./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:45:19,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:45:19,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:45:19,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:45:19,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:45:19,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:45:19,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:45:19,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:45:19,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:45:19,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:45:19,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:45:19,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:45:19,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:45:19,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:45:19,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:45:19,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:45:19,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:45:19,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:45:19,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:45:19,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:45:19,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:45:19,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:45:19,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:45:19,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:45:19,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:45:19,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:45:19,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:45:19,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:45:19,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:45:19,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:45:19,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:45:19,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:45:19,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:45:19,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:45:19,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:45:19,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:45:19,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:45:19,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:45:19,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:45:19,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:45:19,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:45:19,362 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-20 06:45:19,410 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:45:19,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:45:19,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:45:19,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:45:19,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:45:19,420 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:45:19,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:45:19,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:45:19,421 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:45:19,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:45:19,423 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:45:19,423 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:45:19,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:45:19,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:45:19,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:45:19,424 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 06:45:19,424 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 06:45:19,425 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 06:45:19,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:45:19,425 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 06:45:19,425 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:45:19,426 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:45:19,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:45:19,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:45:19,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:45:19,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:45:19,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:45:19,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:45:19,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:45:19,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:45:19,429 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:45:19,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d [2021-11-20 06:45:19,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:45:19,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:45:19,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:45:19,762 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:45:19,763 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:45:19,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2021-11-20 06:45:19,860 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/data/2a88e5666/1ce61064a2c042f3a6bb4ebfabf153ef/FLAG045e0458a [2021-11-20 06:45:20,547 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:45:20,548 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2021-11-20 06:45:20,582 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/data/2a88e5666/1ce61064a2c042f3a6bb4ebfabf153ef/FLAG045e0458a [2021-11-20 06:45:20,750 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/data/2a88e5666/1ce61064a2c042f3a6bb4ebfabf153ef [2021-11-20 06:45:20,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:45:20,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:45:20,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:45:20,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:45:20,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:45:20,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:20" (1/1) ... [2021-11-20 06:45:20,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d84767b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:20, skipping insertion in model container [2021-11-20 06:45:20,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:20" (1/1) ... [2021-11-20 06:45:20,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:45:20,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:45:21,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:45:21,314 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:45:21,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:45:21,404 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:45:21,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21 WrapperNode [2021-11-20 06:45:21,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:45:21,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:45:21,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:45:21,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:45:21,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,511 INFO L137 Inliner]: procedures = 127, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 175 [2021-11-20 06:45:21,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:45:21,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:45:21,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:45:21,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:45:21,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:45:21,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:45:21,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:45:21,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:45:21,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (1/1) ... [2021-11-20 06:45:21,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:45:21,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:45:21,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:45:21,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:45:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 06:45:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:45:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 06:45:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 06:45:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:45:21,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 06:45:21,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:45:21,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:45:21,919 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:45:21,921 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:45:22,585 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:45:22,599 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:45:22,599 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-20 06:45:22,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:22 BoogieIcfgContainer [2021-11-20 06:45:22,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:45:22,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:45:22,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:45:22,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:45:22,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:45:20" (1/3) ... [2021-11-20 06:45:22,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3854d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:45:22, skipping insertion in model container [2021-11-20 06:45:22,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:21" (2/3) ... [2021-11-20 06:45:22,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3854d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:45:22, skipping insertion in model container [2021-11-20 06:45:22,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:22" (3/3) ... [2021-11-20 06:45:22,612 INFO L111 eAbstractionObserver]: Analyzing ICFG skiplist_3lvl.i [2021-11-20 06:45:22,619 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:45:22,619 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-11-20 06:45:22,671 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:45:22,680 INFO L339 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:45:22,680 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-11-20 06:45:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 85 states have (on average 2.176470588235294) internal successors, (185), 170 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-20 06:45:22,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:22,750 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-20 06:45:22,751 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-11-20 06:45:22,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:22,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392326528] [2021-11-20 06:45:22,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:22,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:22,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:22,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392326528] [2021-11-20 06:45:22,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392326528] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:22,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:22,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 06:45:22,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825964546] [2021-11-20 06:45:22,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:22,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:45:22,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:23,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:45:23,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:45:23,029 INFO L87 Difference]: Start difference. First operand has 171 states, 85 states have (on average 2.176470588235294) internal successors, (185), 170 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:23,326 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2021-11-20 06:45:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:45:23,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-11-20 06:45:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:23,342 INFO L225 Difference]: With dead ends: 192 [2021-11-20 06:45:23,343 INFO L226 Difference]: Without dead ends: 190 [2021-11-20 06:45:23,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:45:23,349 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 161 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:23,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 105 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-20 06:45:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2021-11-20 06:45:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 84 states have (on average 2.011904761904762) internal successors, (169), 159 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2021-11-20 06:45:23,433 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 3 [2021-11-20 06:45:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:23,434 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2021-11-20 06:45:23,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2021-11-20 06:45:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-20 06:45:23,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:23,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-20 06:45:23,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 06:45:23,436 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-11-20 06:45:23,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:23,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264609103] [2021-11-20 06:45:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:23,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:23,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:23,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264609103] [2021-11-20 06:45:23,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264609103] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:23,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:23,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 06:45:23,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975302629] [2021-11-20 06:45:23,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:23,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:45:23,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:23,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:45:23,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:45:23,551 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:23,729 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2021-11-20 06:45:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:45:23,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-11-20 06:45:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:23,732 INFO L225 Difference]: With dead ends: 159 [2021-11-20 06:45:23,732 INFO L226 Difference]: Without dead ends: 159 [2021-11-20 06:45:23,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:45:23,734 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:23,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-20 06:45:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-11-20 06:45:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 84 states have (on average 2.0) internal successors, (168), 158 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) [2021-11-20 06:45:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2021-11-20 06:45:23,748 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 3 [2021-11-20 06:45:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:23,749 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2021-11-20 06:45:23,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2021-11-20 06:45:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-20 06:45:23,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:23,750 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-20 06:45:23,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 06:45:23,751 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2021-11-20 06:45:23,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:23,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921766203] [2021-11-20 06:45:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:23,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:23,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:23,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921766203] [2021-11-20 06:45:23,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921766203] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:23,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:23,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 06:45:23,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963794567] [2021-11-20 06:45:23,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:23,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:45:23,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:23,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:45:23,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:45:23,840 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:24,068 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2021-11-20 06:45:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:45:24,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-11-20 06:45:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:24,071 INFO L225 Difference]: With dead ends: 181 [2021-11-20 06:45:24,071 INFO L226 Difference]: Without dead ends: 181 [2021-11-20 06:45:24,071 INFO L932 BasicCegarLoop]: 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 [2021-11-20 06:45:24,073 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 336 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:24,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 67 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-20 06:45:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2021-11-20 06:45:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 84 states have (on average 1.9047619047619047) internal successors, (160), 150 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) [2021-11-20 06:45:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2021-11-20 06:45:24,084 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 5 [2021-11-20 06:45:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:24,085 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2021-11-20 06:45:24,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2021-11-20 06:45:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 06:45:24,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:24,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:24,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 06:45:24,087 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2021-11-20 06:45:24,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:24,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305664628] [2021-11-20 06:45:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:24,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:24,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:24,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305664628] [2021-11-20 06:45:24,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305664628] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:24,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:24,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:45:24,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707136959] [2021-11-20 06:45:24,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:24,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:45:24,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:45:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:45:24,175 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:24,436 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2021-11-20 06:45:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:45:24,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-11-20 06:45:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:24,438 INFO L225 Difference]: With dead ends: 150 [2021-11-20 06:45:24,438 INFO L226 Difference]: Without dead ends: 150 [2021-11-20 06:45:24,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:45:24,440 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 11 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:24,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 384 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:24,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-20 06:45:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-11-20 06:45:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 149 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) [2021-11-20 06:45:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2021-11-20 06:45:24,449 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 11 [2021-11-20 06:45:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:24,450 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2021-11-20 06:45:24,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2021-11-20 06:45:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 06:45:24,451 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:24,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:24,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 06:45:24,452 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2021-11-20 06:45:24,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:24,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413462949] [2021-11-20 06:45:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:24,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:24,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:24,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413462949] [2021-11-20 06:45:24,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413462949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:24,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:24,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:45:24,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94926981] [2021-11-20 06:45:24,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:24,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:45:24,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:24,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:45:24,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:45:24,611 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:24,906 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2021-11-20 06:45:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:45:24,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-11-20 06:45:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:24,908 INFO L225 Difference]: With dead ends: 149 [2021-11-20 06:45:24,908 INFO L226 Difference]: Without dead ends: 149 [2021-11-20 06:45:24,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:45:24,910 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 14 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:24,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 365 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-11-20 06:45:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-11-20 06:45:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 84 states have (on average 1.880952380952381) internal successors, (158), 148 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) [2021-11-20 06:45:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions. [2021-11-20 06:45:24,924 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 11 [2021-11-20 06:45:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:24,924 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 158 transitions. [2021-11-20 06:45:24,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2021-11-20 06:45:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 06:45:24,925 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:24,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:24,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 06:45:24,926 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1786545203, now seen corresponding path program 1 times [2021-11-20 06:45:24,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:24,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588798989] [2021-11-20 06:45:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:24,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:25,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:25,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588798989] [2021-11-20 06:45:25,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588798989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:25,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:25,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:45:25,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612892934] [2021-11-20 06:45:25,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:25,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:45:25,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:45:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:45:25,022 INFO L87 Difference]: Start difference. First operand 149 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:25,157 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2021-11-20 06:45:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:45:25,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-11-20 06:45:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:25,159 INFO L225 Difference]: With dead ends: 148 [2021-11-20 06:45:25,159 INFO L226 Difference]: Without dead ends: 148 [2021-11-20 06:45:25,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:45:25,165 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:25,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 487 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:45:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-20 06:45:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-11-20 06:45:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 84 states have (on average 1.869047619047619) internal successors, (157), 147 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) [2021-11-20 06:45:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2021-11-20 06:45:25,178 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 12 [2021-11-20 06:45:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:25,179 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2021-11-20 06:45:25,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2021-11-20 06:45:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 06:45:25,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:25,180 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:25,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 06:45:25,182 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:25,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:25,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1786545204, now seen corresponding path program 1 times [2021-11-20 06:45:25,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:25,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28015956] [2021-11-20 06:45:25,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:25,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:25,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:25,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28015956] [2021-11-20 06:45:25,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28015956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:25,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:25,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:45:25,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085465356] [2021-11-20 06:45:25,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:25,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 06:45:25,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:25,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:45:25,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:45:25,433 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:25,870 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2021-11-20 06:45:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:45:25,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-11-20 06:45:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:25,872 INFO L225 Difference]: With dead ends: 147 [2021-11-20 06:45:25,872 INFO L226 Difference]: Without dead ends: 147 [2021-11-20 06:45:25,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:45:25,873 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 15 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:25,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 529 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 06:45:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-20 06:45:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-11-20 06:45:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.8571428571428572) internal successors, (156), 146 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) [2021-11-20 06:45:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2021-11-20 06:45:25,879 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 12 [2021-11-20 06:45:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:25,879 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2021-11-20 06:45:25,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2021-11-20 06:45:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 06:45:25,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:25,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:25,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 06:45:25,881 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:25,881 INFO L85 PathProgramCache]: Analyzing trace with hash -451673556, now seen corresponding path program 1 times [2021-11-20 06:45:25,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:25,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317499036] [2021-11-20 06:45:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:25,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:25,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:25,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317499036] [2021-11-20 06:45:25,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317499036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:25,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:25,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:45:25,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070603145] [2021-11-20 06:45:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:25,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:45:25,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:45:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:45:25,930 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:26,076 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2021-11-20 06:45:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:45:26,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-11-20 06:45:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:26,078 INFO L225 Difference]: With dead ends: 146 [2021-11-20 06:45:26,078 INFO L226 Difference]: Without dead ends: 146 [2021-11-20 06:45:26,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:45:26,078 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 8 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:26,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 483 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:45:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-20 06:45:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-11-20 06:45:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 84 states have (on average 1.8452380952380953) internal successors, (155), 145 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2021-11-20 06:45:26,083 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 13 [2021-11-20 06:45:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:26,083 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2021-11-20 06:45:26,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2021-11-20 06:45:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 06:45:26,084 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:26,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:26,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 06:45:26,085 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash -451673555, now seen corresponding path program 1 times [2021-11-20 06:45:26,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:26,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58106933] [2021-11-20 06:45:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:26,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:26,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:26,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58106933] [2021-11-20 06:45:26,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58106933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:26,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:26,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:45:26,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963026717] [2021-11-20 06:45:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:26,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 06:45:26,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:45:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:45:26,296 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:26,602 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2021-11-20 06:45:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:45:26,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-11-20 06:45:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:26,605 INFO L225 Difference]: With dead ends: 145 [2021-11-20 06:45:26,605 INFO L226 Difference]: Without dead ends: 145 [2021-11-20 06:45:26,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:45:26,613 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 16 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:26,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 443 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-20 06:45:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-11-20 06:45:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.8333333333333333) internal successors, (154), 144 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2021-11-20 06:45:26,618 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 13 [2021-11-20 06:45:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:26,619 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2021-11-20 06:45:26,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2021-11-20 06:45:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 06:45:26,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:26,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:26,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 06:45:26,620 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:26,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash -598729444, now seen corresponding path program 1 times [2021-11-20 06:45:26,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:26,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861110626] [2021-11-20 06:45:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:26,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:26,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:26,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861110626] [2021-11-20 06:45:26,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861110626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:26,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:26,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 06:45:26,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594388342] [2021-11-20 06:45:26,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:26,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 06:45:26,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:26,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:45:26,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:45:26,968 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:27,347 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2021-11-20 06:45:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:45:27,348 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-11-20 06:45:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:27,349 INFO L225 Difference]: With dead ends: 144 [2021-11-20 06:45:27,349 INFO L226 Difference]: Without dead ends: 144 [2021-11-20 06:45:27,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:45:27,350 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:27,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 752 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:45:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-20 06:45:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-20 06:45:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 84 states have (on average 1.8214285714285714) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2021-11-20 06:45:27,355 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 18 [2021-11-20 06:45:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:27,355 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2021-11-20 06:45:27,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2021-11-20 06:45:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 06:45:27,356 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:27,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:27,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 06:45:27,357 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -598729443, now seen corresponding path program 1 times [2021-11-20 06:45:27,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:27,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868086527] [2021-11-20 06:45:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:27,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:27,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:27,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868086527] [2021-11-20 06:45:27,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868086527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:27,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:27,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 06:45:27,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77382354] [2021-11-20 06:45:27,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:27,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 06:45:27,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:27,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:45:27,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:45:27,651 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:27,985 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-11-20 06:45:27,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:45:27,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-11-20 06:45:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:27,986 INFO L225 Difference]: With dead ends: 143 [2021-11-20 06:45:27,986 INFO L226 Difference]: Without dead ends: 143 [2021-11-20 06:45:27,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:45:27,988 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 30 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:27,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 697 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:45:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-20 06:45:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-20 06:45:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 142 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2021-11-20 06:45:27,992 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 18 [2021-11-20 06:45:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:27,992 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2021-11-20 06:45:27,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2021-11-20 06:45:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-20 06:45:27,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:27,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:27,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 06:45:27,993 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1380743565, now seen corresponding path program 1 times [2021-11-20 06:45:27,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:27,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056904842] [2021-11-20 06:45:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:27,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:28,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:28,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056904842] [2021-11-20 06:45:28,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056904842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:28,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:28,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:45:28,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682018825] [2021-11-20 06:45:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:28,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:45:28,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:28,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:45:28,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:45:28,036 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:28,167 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2021-11-20 06:45:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:45:28,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-11-20 06:45:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:28,169 INFO L225 Difference]: With dead ends: 142 [2021-11-20 06:45:28,169 INFO L226 Difference]: Without dead ends: 142 [2021-11-20 06:45:28,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:45:28,170 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 11 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:28,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 469 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:45:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-20 06:45:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-11-20 06:45:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 84 states have (on average 1.7976190476190477) internal successors, (151), 141 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2021-11-20 06:45:28,174 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2021-11-20 06:45:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:28,175 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2021-11-20 06:45:28,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2021-11-20 06:45:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-20 06:45:28,176 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:28,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:28,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 06:45:28,176 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:28,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1380743564, now seen corresponding path program 1 times [2021-11-20 06:45:28,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:28,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717408131] [2021-11-20 06:45:28,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:28,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:28,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:28,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717408131] [2021-11-20 06:45:28,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717408131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:28,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:28,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-20 06:45:28,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932739319] [2021-11-20 06:45:28,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:28,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 06:45:28,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:45:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-11-20 06:45:28,553 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:28,958 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2021-11-20 06:45:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 06:45:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-11-20 06:45:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:28,960 INFO L225 Difference]: With dead ends: 141 [2021-11-20 06:45:28,960 INFO L226 Difference]: Without dead ends: 141 [2021-11-20 06:45:28,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:45:28,961 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 31 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:28,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 693 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:45:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-20 06:45:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-11-20 06:45:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.7857142857142858) internal successors, (150), 140 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) [2021-11-20 06:45:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2021-11-20 06:45:28,966 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 19 [2021-11-20 06:45:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:28,966 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2021-11-20 06:45:28,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2021-11-20 06:45:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 06:45:28,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:28,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:28,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 06:45:28,967 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash 146622463, now seen corresponding path program 1 times [2021-11-20 06:45:28,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:28,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821116503] [2021-11-20 06:45:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:28,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:29,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:29,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821116503] [2021-11-20 06:45:29,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821116503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:29,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:29,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:45:29,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922897948] [2021-11-20 06:45:29,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:29,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:45:29,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:29,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:45:29,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:45:29,009 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:29,134 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2021-11-20 06:45:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:45:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-20 06:45:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:29,135 INFO L225 Difference]: With dead ends: 140 [2021-11-20 06:45:29,135 INFO L226 Difference]: Without dead ends: 140 [2021-11-20 06:45:29,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:45:29,136 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:29,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 465 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:45:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-20 06:45:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-11-20 06:45:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 139 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) [2021-11-20 06:45:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2021-11-20 06:45:29,141 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 20 [2021-11-20 06:45:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:29,142 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2021-11-20 06:45:29,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2021-11-20 06:45:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 06:45:29,143 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:29,143 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:45:29,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 06:45:29,143 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash 146622464, now seen corresponding path program 1 times [2021-11-20 06:45:29,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:29,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974608378] [2021-11-20 06:45:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:29,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:29,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:29,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974608378] [2021-11-20 06:45:29,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974608378] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:29,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:29,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-20 06:45:29,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829692799] [2021-11-20 06:45:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:29,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 06:45:29,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:45:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-11-20 06:45:29,553 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:30,032 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2021-11-20 06:45:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 06:45:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-20 06:45:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:30,034 INFO L225 Difference]: With dead ends: 139 [2021-11-20 06:45:30,034 INFO L226 Difference]: Without dead ends: 139 [2021-11-20 06:45:30,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:45:30,035 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 23 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:30,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 843 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:45:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-20 06:45:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-11-20 06:45:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.7619047619047619) internal successors, (148), 138 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) [2021-11-20 06:45:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2021-11-20 06:45:30,039 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 20 [2021-11-20 06:45:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:30,039 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2021-11-20 06:45:30,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2021-11-20 06:45:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 06:45:30,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:30,041 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:30,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-20 06:45:30,041 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:30,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1043484996, now seen corresponding path program 1 times [2021-11-20 06:45:30,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:30,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523057277] [2021-11-20 06:45:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:30,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:30,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:30,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523057277] [2021-11-20 06:45:30,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523057277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:30,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:30,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:45:30,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57194465] [2021-11-20 06:45:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:30,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:45:30,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:30,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:45:30,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:45:30,146 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:30,356 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2021-11-20 06:45:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:45:30,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-11-20 06:45:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:30,358 INFO L225 Difference]: With dead ends: 200 [2021-11-20 06:45:30,358 INFO L226 Difference]: Without dead ends: 200 [2021-11-20 06:45:30,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:45:30,359 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 478 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:30,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 172 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-20 06:45:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 137. [2021-11-20 06:45:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.7380952380952381) internal successors, (146), 136 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2021-11-20 06:45:30,363 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 25 [2021-11-20 06:45:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:30,363 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2021-11-20 06:45:30,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2021-11-20 06:45:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 06:45:30,364 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:30,364 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:30,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-20 06:45:30,365 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:30,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1043484995, now seen corresponding path program 1 times [2021-11-20 06:45:30,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:30,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938907591] [2021-11-20 06:45:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:30,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:30,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:30,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938907591] [2021-11-20 06:45:30,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938907591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:30,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:30,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:45:30,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766851204] [2021-11-20 06:45:30,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:30,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:45:30,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:30,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:45:30,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:45:30,526 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:30,752 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2021-11-20 06:45:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:45:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-11-20 06:45:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:30,754 INFO L225 Difference]: With dead ends: 171 [2021-11-20 06:45:30,754 INFO L226 Difference]: Without dead ends: 171 [2021-11-20 06:45:30,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:45:30,755 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 502 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:30,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 134 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-20 06:45:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2021-11-20 06:45:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.7142857142857142) internal successors, (144), 134 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2021-11-20 06:45:30,760 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 25 [2021-11-20 06:45:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:30,760 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2021-11-20 06:45:30,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2021-11-20 06:45:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-20 06:45:30,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:30,761 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:30,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-20 06:45:30,762 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2011706153, now seen corresponding path program 1 times [2021-11-20 06:45:30,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:30,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717288200] [2021-11-20 06:45:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:30,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:30,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:30,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717288200] [2021-11-20 06:45:30,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717288200] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:30,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:30,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:45:30,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774094521] [2021-11-20 06:45:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:30,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:45:30,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:45:30,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:45:30,840 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:31,039 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2021-11-20 06:45:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:45:31,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-20 06:45:31,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:31,041 INFO L225 Difference]: With dead ends: 156 [2021-11-20 06:45:31,041 INFO L226 Difference]: Without dead ends: 156 [2021-11-20 06:45:31,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:45:31,042 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 384 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:31,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 164 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-20 06:45:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2021-11-20 06:45:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 131 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) [2021-11-20 06:45:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2021-11-20 06:45:31,047 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 26 [2021-11-20 06:45:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:31,047 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2021-11-20 06:45:31,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2021-11-20 06:45:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-20 06:45:31,048 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:31,048 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:31,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-20 06:45:31,049 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2011706154, now seen corresponding path program 1 times [2021-11-20 06:45:31,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:31,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271394902] [2021-11-20 06:45:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:31,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:31,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:31,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271394902] [2021-11-20 06:45:31,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271394902] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:31,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:31,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:45:31,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574613447] [2021-11-20 06:45:31,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:31,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:45:31,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:31,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:45:31,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:45:31,131 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:31,328 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2021-11-20 06:45:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:45:31,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-20 06:45:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:31,330 INFO L225 Difference]: With dead ends: 127 [2021-11-20 06:45:31,330 INFO L226 Difference]: Without dead ends: 127 [2021-11-20 06:45:31,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:45:31,331 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 492 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:31,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 124 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:45:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-20 06:45:31,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-11-20 06:45:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 85 states have (on average 1.6) internal successors, (136), 126 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2021-11-20 06:45:31,335 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 26 [2021-11-20 06:45:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:31,336 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2021-11-20 06:45:31,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2021-11-20 06:45:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 06:45:31,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:31,337 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:31,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-20 06:45:31,337 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:31,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:31,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2061699999, now seen corresponding path program 1 times [2021-11-20 06:45:31,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:31,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917580350] [2021-11-20 06:45:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:31,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:31,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:31,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917580350] [2021-11-20 06:45:31,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917580350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:31,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:31,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-20 06:45:31,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892150555] [2021-11-20 06:45:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:31,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 06:45:31,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:31,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 06:45:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-11-20 06:45:31,823 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:33,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:33,058 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2021-11-20 06:45:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 06:45:33,059 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-11-20 06:45:33,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:33,060 INFO L225 Difference]: With dead ends: 209 [2021-11-20 06:45:33,060 INFO L226 Difference]: Without dead ends: 209 [2021-11-20 06:45:33,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2021-11-20 06:45:33,065 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 559 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:33,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 1110 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 06:45:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-20 06:45:33,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 128. [2021-11-20 06:45:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2021-11-20 06:45:33,072 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 27 [2021-11-20 06:45:33,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:33,072 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2021-11-20 06:45:33,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2021-11-20 06:45:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 06:45:33,073 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:33,073 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:33,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-20 06:45:33,074 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:33,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2061699998, now seen corresponding path program 1 times [2021-11-20 06:45:33,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:33,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570870244] [2021-11-20 06:45:33,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:33,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:33,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:33,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570870244] [2021-11-20 06:45:33,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570870244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:33,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:33,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-20 06:45:33,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876571215] [2021-11-20 06:45:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:33,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 06:45:33,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:33,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 06:45:33,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-11-20 06:45:33,891 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:35,317 INFO L93 Difference]: Finished difference Result 281 states and 306 transitions. [2021-11-20 06:45:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 06:45:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-11-20 06:45:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:35,319 INFO L225 Difference]: With dead ends: 281 [2021-11-20 06:45:35,320 INFO L226 Difference]: Without dead ends: 281 [2021-11-20 06:45:35,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2021-11-20 06:45:35,322 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 889 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:35,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [889 Valid, 1134 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-20 06:45:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-11-20 06:45:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 166. [2021-11-20 06:45:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.625) internal successors, (208), 165 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2021-11-20 06:45:35,329 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 27 [2021-11-20 06:45:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:35,329 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2021-11-20 06:45:35,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2021-11-20 06:45:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-20 06:45:35,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:35,330 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:35,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-20 06:45:35,330 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1235458799, now seen corresponding path program 1 times [2021-11-20 06:45:35,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084237371] [2021-11-20 06:45:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:35,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:35,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:35,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084237371] [2021-11-20 06:45:35,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084237371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:35,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:35,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:45:35,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956502207] [2021-11-20 06:45:35,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:35,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:45:35,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:35,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:45:35,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:45:35,391 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:35,478 INFO L93 Difference]: Finished difference Result 165 states and 207 transitions. [2021-11-20 06:45:35,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:45:35,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-20 06:45:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:35,483 INFO L225 Difference]: With dead ends: 165 [2021-11-20 06:45:35,484 INFO L226 Difference]: Without dead ends: 165 [2021-11-20 06:45:35,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:45:35,485 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 345 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:35,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 212 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:45:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-20 06:45:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-11-20 06:45:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.6171875) internal successors, (207), 164 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2021-11-20 06:45:35,492 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 207 transitions. Word has length 29 [2021-11-20 06:45:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:35,493 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 207 transitions. [2021-11-20 06:45:35,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 207 transitions. [2021-11-20 06:45:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 06:45:35,494 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:35,494 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:35,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-20 06:45:35,495 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1863814087, now seen corresponding path program 1 times [2021-11-20 06:45:35,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:35,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903792091] [2021-11-20 06:45:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:35,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:35,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:35,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903792091] [2021-11-20 06:45:35,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903792091] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:35,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:35,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-20 06:45:35,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058863318] [2021-11-20 06:45:35,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:35,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 06:45:35,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:35,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 06:45:35,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:45:35,989 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:36,776 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2021-11-20 06:45:36,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 06:45:36,776 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-11-20 06:45:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:36,778 INFO L225 Difference]: With dead ends: 224 [2021-11-20 06:45:36,778 INFO L226 Difference]: Without dead ends: 224 [2021-11-20 06:45:36,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 06:45:36,779 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 427 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:36,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 1010 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 06:45:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-20 06:45:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2021-11-20 06:45:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.6) internal successors, (216), 171 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2021-11-20 06:45:36,785 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 31 [2021-11-20 06:45:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:36,785 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2021-11-20 06:45:36,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2021-11-20 06:45:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 06:45:36,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:36,786 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:36,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-20 06:45:36,786 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:36,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1863814086, now seen corresponding path program 1 times [2021-11-20 06:45:36,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:36,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986920585] [2021-11-20 06:45:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:36,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:37,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:37,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986920585] [2021-11-20 06:45:37,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986920585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:37,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:37,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-20 06:45:37,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772399261] [2021-11-20 06:45:37,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:37,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 06:45:37,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:37,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 06:45:37,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-11-20 06:45:37,547 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:38,784 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2021-11-20 06:45:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 06:45:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-11-20 06:45:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:38,786 INFO L225 Difference]: With dead ends: 224 [2021-11-20 06:45:38,786 INFO L226 Difference]: Without dead ends: 224 [2021-11-20 06:45:38,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2021-11-20 06:45:38,788 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 361 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:38,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 1001 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-20 06:45:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-20 06:45:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2021-11-20 06:45:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.5925925925925926) internal successors, (215), 171 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 215 transitions. [2021-11-20 06:45:38,794 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 215 transitions. Word has length 31 [2021-11-20 06:45:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:38,794 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 215 transitions. [2021-11-20 06:45:38,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 215 transitions. [2021-11-20 06:45:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-20 06:45:38,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:38,795 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:38,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-20 06:45:38,796 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1978046457, now seen corresponding path program 1 times [2021-11-20 06:45:38,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:38,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034508091] [2021-11-20 06:45:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:38,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:39,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:39,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034508091] [2021-11-20 06:45:39,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034508091] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:39,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:39,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-20 06:45:39,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831171213] [2021-11-20 06:45:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:39,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 06:45:39,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:39,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 06:45:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-11-20 06:45:39,259 INFO L87 Difference]: Start difference. First operand 172 states and 215 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:39,976 INFO L93 Difference]: Finished difference Result 217 states and 265 transitions. [2021-11-20 06:45:39,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 06:45:39,976 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-20 06:45:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:39,977 INFO L225 Difference]: With dead ends: 217 [2021-11-20 06:45:39,977 INFO L226 Difference]: Without dead ends: 217 [2021-11-20 06:45:39,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 06:45:39,979 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 268 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:39,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 1257 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 06:45:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-20 06:45:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 172. [2021-11-20 06:45:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.5851851851851853) internal successors, (214), 171 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2021-11-20 06:45:39,984 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 32 [2021-11-20 06:45:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:39,985 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2021-11-20 06:45:39,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2021-11-20 06:45:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-20 06:45:39,986 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:39,986 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:39,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-20 06:45:39,986 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash 190378255, now seen corresponding path program 1 times [2021-11-20 06:45:39,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:39,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463272432] [2021-11-20 06:45:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:39,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:40,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:40,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463272432] [2021-11-20 06:45:40,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463272432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:40,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:40,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 06:45:40,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343049980] [2021-11-20 06:45:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:40,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:45:40,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:45:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:45:40,027 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:40,159 INFO L93 Difference]: Finished difference Result 189 states and 229 transitions. [2021-11-20 06:45:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:45:40,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-20 06:45:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:40,160 INFO L225 Difference]: With dead ends: 189 [2021-11-20 06:45:40,160 INFO L226 Difference]: Without dead ends: 189 [2021-11-20 06:45:40,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:45:40,161 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 169 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:40,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 150 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:45:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-20 06:45:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 170. [2021-11-20 06:45:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.532846715328467) internal successors, (210), 169 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2021-11-20 06:45:40,170 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 33 [2021-11-20 06:45:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:40,170 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2021-11-20 06:45:40,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2021-11-20 06:45:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-20 06:45:40,171 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:40,171 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:40,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-20 06:45:40,171 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash 190378256, now seen corresponding path program 1 times [2021-11-20 06:45:40,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:40,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425362528] [2021-11-20 06:45:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:40,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:41,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:41,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425362528] [2021-11-20 06:45:41,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425362528] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:41,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:41,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-20 06:45:41,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796936149] [2021-11-20 06:45:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:41,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 06:45:41,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:41,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 06:45:41,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-11-20 06:45:41,062 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:42,653 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2021-11-20 06:45:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 06:45:42,654 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-20 06:45:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:42,655 INFO L225 Difference]: With dead ends: 282 [2021-11-20 06:45:42,655 INFO L226 Difference]: Without dead ends: 282 [2021-11-20 06:45:42,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=1711, Unknown=0, NotChecked=0, Total=1980 [2021-11-20 06:45:42,656 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 766 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:42,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 1313 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-20 06:45:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-20 06:45:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 183. [2021-11-20 06:45:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 150 states have (on average 1.5333333333333334) internal successors, (230), 182 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2021-11-20 06:45:42,663 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 33 [2021-11-20 06:45:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:42,663 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2021-11-20 06:45:42,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2021-11-20 06:45:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-20 06:45:42,664 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:42,664 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:42,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-20 06:45:42,665 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:42,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash 451934574, now seen corresponding path program 1 times [2021-11-20 06:45:42,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:42,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236250072] [2021-11-20 06:45:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:42,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:43,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:43,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236250072] [2021-11-20 06:45:43,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236250072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:45:43,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:45:43,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-20 06:45:43,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40106848] [2021-11-20 06:45:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:45:43,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 06:45:43,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:45:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 06:45:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2021-11-20 06:45:43,522 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:45:44,703 INFO L93 Difference]: Finished difference Result 238 states and 292 transitions. [2021-11-20 06:45:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 06:45:44,704 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-11-20 06:45:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:45:44,705 INFO L225 Difference]: With dead ends: 238 [2021-11-20 06:45:44,705 INFO L226 Difference]: Without dead ends: 238 [2021-11-20 06:45:44,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 06:45:44,706 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 275 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:45:44,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 1373 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 06:45:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-20 06:45:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2021-11-20 06:45:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.522875816993464) internal successors, (233), 185 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2021-11-20 06:45:44,715 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2021-11-20 06:45:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:45:44,716 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2021-11-20 06:45:44,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:45:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2021-11-20 06:45:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-20 06:45:44,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:45:44,717 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:45:44,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-20 06:45:44,717 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-11-20 06:45:44,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:45:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1606811227, now seen corresponding path program 1 times [2021-11-20 06:45:44,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:45:44,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672644906] [2021-11-20 06:45:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:44,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:45:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:45:46,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:45:46,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672644906] [2021-11-20 06:45:46,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672644906] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:45:46,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258187308] [2021-11-20 06:45:46,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:45:46,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:45:46,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:45:46,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:45:46,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60926c3b-6a06-4708-9d7f-df8f813b2a49/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 06:45:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:45:46,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-20 06:45:46,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:45:46,299 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:45:46,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-11-20 06:45:46,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-11-20 06:45:46,541 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-11-20 06:45:46,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-11-20 06:45:46,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:45:46,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2021-11-20 06:45:47,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:45:47,511 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-20 06:45:47,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 76 [2021-11-20 06:45:47,530 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 06:45:47,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 84 [2021-11-20 06:45:47,792 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-20 06:45:47,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 97 [2021-11-20 06:45:47,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:45:47,811 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-20 06:45:47,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 78 [2021-11-20 06:45:52,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:45:52,137 INFO L354 Elim1Store]: treesize reduction 142, result has 15.5 percent of original size [2021-11-20 06:45:52,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 90 [2021-11-20 06:45:52,171 INFO L354 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2021-11-20 06:45:52,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 143 [2021-11-20 06:45:52,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:45:52,995 INFO L354 Elim1Store]: treesize reduction 210, result has 15.7 percent of original size [2021-11-20 06:45:52,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 202 treesize of output 116 [2021-11-20 06:45:53,042 INFO L354 Elim1Store]: treesize reduction 146, result has 18.0 percent of original size [2021-11-20 06:45:53,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 178 treesize of output 166 [2021-11-20 06:45:55,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:45:55,402 INFO L354 Elim1Store]: treesize reduction 304, result has 13.1 percent of original size [2021-11-20 06:45:55,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 295 treesize of output 134 [2021-11-20 06:45:55,456 INFO L354 Elim1Store]: treesize reduction 224, result has 14.8 percent of original size [2021-11-20 06:45:55,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 277 treesize of output 227 [2021-11-20 06:46:03,750 WARN L227 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 62 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:46:03,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:46:03,854 INFO L354 Elim1Store]: treesize reduction 318, result has 13.1 percent of original size [2021-11-20 06:46:03,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 282 treesize of output 135 [2021-11-20 06:46:03,931 INFO L354 Elim1Store]: treesize reduction 236, result has 14.8 percent of original size [2021-11-20 06:46:03,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 264 treesize of output 218 [2021-11-20 06:46:14,177 WARN L227 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:46:20,403 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:46:31,918 WARN L227 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:46:31,956 INFO L354 Elim1Store]: treesize reduction 160, result has 0.6 percent of original size [2021-11-20 06:46:31,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 263 treesize of output 185 [2021-11-20 06:46:32,752 INFO L354 Elim1Store]: treesize reduction 200, result has 0.5 percent of original size [2021-11-20 06:46:32,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 161 treesize of output 49 [2021-11-20 06:46:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:46:33,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:46:34,653 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset| Int)) (= (select |c_#valid| (let ((.cse1 (+ 8 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base|) .cse1 0)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base|) .cse1 0)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))) 1)) is different from false [2021-11-20 06:46:36,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset| Int)) (= (select |c_#valid| (let ((.cse2 (+ 8 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset|)) (.cse3 (+ 4 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset|))) (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base|) .cse3 0)))) (store .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| (store (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base|) .cse2 0))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base|) .cse3 0)))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base|) .cse2 0))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) 1)) is different from false [2021-11-20 06:49:31,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset| Int)) (= (select |c_#valid| (let ((.cse6 (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (.cse3 (+ 4 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset|)) (.cse4 (+ 8 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (store (store (select .cse1 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|)))) (store .cse5 .cse2 (store (store (store (select .cse5 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))))) 1)) is different from false [2021-11-20 06:49:33,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset| Int)) (= (select |c_#valid| (let ((.cse7 (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|)) (.cse8 (+ |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| 4))) (let ((.cse1 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|)))) (store .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (.cse3 (+ 4 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset|)) (.cse4 (+ 8 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (store (store (select .cse1 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|)))) (store .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|))))) (store .cse5 .cse2 (store (store (store (select .cse5 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))))) 1)) is different from false [2021-11-20 06:49:35,546 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset| Int)) (= (select |c_#valid| (let ((.cse7 (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|)) (.cse9 (+ |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| 4))) (let ((.cse1 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|)))) (store .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (store .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (.cse3 (+ 4 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset|)) (.cse4 (+ 8 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (store (store (select .cse1 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (let ((.cse5 (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|)))) (store .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) .cse9 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|))))) (store .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|))))) (store .cse5 .cse2 (store (store (store (select .cse5 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))))) 1)) is different from false [2021-11-20 06:49:37,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset| Int)) (= (select |c_#valid| (let ((.cse7 (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|)) (.cse9 (+ |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| 4)) (.cse10 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse10))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| .cse12)))) (store .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) .cse9 .cse12))))) (store .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 .cse12)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse10)) (.cse3 (+ 4 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset|)) (.cse4 (+ 8 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (store (store (select .cse1 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (let ((.cse5 (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|)))) (store .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) .cse9 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|))))) (store .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|))))) (store .cse5 .cse2 (store (store (store (select .cse5 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))))) 1)) is different from false [2021-11-20 06:49:39,655 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset| Int)) (= (select |c_#valid| (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse7 (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|)) (.cse9 (+ |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| 4)) (.cse10 (select .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse11 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse13 (select .cse15 .cse11))) (let ((.cse12 (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| .cse13)))) (store .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) .cse9 .cse13))))) (store .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 .cse13)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse11)) (.cse3 (+ 4 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset|)) (.cse4 (+ 8 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (store (store (select .cse1 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (let ((.cse5 (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|)))) (store .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) .cse9 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|))))) (store .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|))))) (store .cse5 .cse2 (store (store (store (select .cse5 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))))) 1)) is different from false [2021-11-20 06:49:41,712 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| Int) (|ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset| Int)) (= (select |c_#valid| (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse7 (+ 8 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|)) (.cse8 (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse9 (+ |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| 4)) (.cse10 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse12 (select .cse13 .cse10))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse8 (store (store (select |c_#memory_$Pointer$.base| .cse8) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| .cse12) .cse9 .cse12)))) (store .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 .cse12)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse10)) (.cse3 (+ 4 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.offset|)) (.cse4 (+ 8 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (store (store (select .cse1 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse8 (store (store (select |c_#memory_$Pointer$.offset| .cse8) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.offset| |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|) .cse9 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|)))) (store .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) .cse7 |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.offset|))))) (store .cse5 .cse2 (store (store (store (select .cse5 .cse2) |ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.offset| 0) .cse3 0) .cse4 0))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))))) 1)) is different from false [2021-11-20 06:49:41,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143834 treesize of output 133610