./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc03d948b3133d1e09e5b9df570e018433e0831cbe27440ede702c2678003704 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:41:01,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:41:01,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:41:01,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:41:01,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:41:01,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:41:01,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:41:01,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:41:01,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:41:01,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:41:01,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:41:01,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:41:01,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:41:01,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:41:01,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:41:01,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:41:01,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:41:01,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:41:01,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:41:01,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:41:01,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:41:01,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:41:01,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:41:01,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:41:01,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:41:01,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:41:01,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:41:01,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:41:01,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:41:01,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:41:01,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:41:01,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:41:01,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:41:01,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:41:01,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:41:01,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:41:01,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:41:01,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:41:01,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:41:01,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:41:01,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:41:01,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-07 01:41:01,703 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:41:01,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:41:01,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:41:01,712 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:41:01,712 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:41:01,712 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:41:01,713 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:41:01,713 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:41:01,713 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:41:01,713 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:41:01,714 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:41:01,715 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:41:01,715 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:41:01,715 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:41:01,716 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:41:01,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 01:41:01,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 01:41:01,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:41:01,718 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:41:01,718 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 01:41:01,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:41:01,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:41:01,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:41:01,719 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 01:41:01,719 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 01:41:01,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:41:01,721 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:41:01,721 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:41:01,721 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:41:01,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:41:01,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:41:01,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:41:01,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:41:01,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:41:01,723 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:41:01,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:41:01,724 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:41:01,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:41:01,724 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/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_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> fc03d948b3133d1e09e5b9df570e018433e0831cbe27440ede702c2678003704 [2021-11-07 01:41:02,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:41:02,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:41:02,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:41:02,111 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:41:02,112 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:41:02,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2021-11-07 01:41:02,192 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/data/fad085dc9/9a4e8c1122524b6aaaf0a826af283452/FLAG0bd03efec [2021-11-07 01:41:02,978 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:41:02,979 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2021-11-07 01:41:02,994 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/data/fad085dc9/9a4e8c1122524b6aaaf0a826af283452/FLAG0bd03efec [2021-11-07 01:41:03,225 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/data/fad085dc9/9a4e8c1122524b6aaaf0a826af283452 [2021-11-07 01:41:03,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:41:03,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:41:03,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:41:03,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:41:03,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:41:03,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452da856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03, skipping insertion in model container [2021-11-07 01:41:03,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:41:03,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:41:03,681 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i[22617,22630] [2021-11-07 01:41:03,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:41:03,712 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:41:03,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i[22617,22630] [2021-11-07 01:41:03,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:41:03,809 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:41:03,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03 WrapperNode [2021-11-07 01:41:03,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:41:03,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:41:03,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:41:03,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:41:03,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:41:03,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:41:03,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:41:03,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:41:03,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:41:03,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:41:03,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:41:03,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:41:03,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (1/1) ... [2021-11-07 01:41:03,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:41:03,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:41:03,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:41:03,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:41:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 01:41:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 01:41:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 01:41:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 01:41:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:41:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 01:41:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:41:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:41:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:41:04,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:41:04,884 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:41:04,885 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-11-07 01:41:04,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:04 BoogieIcfgContainer [2021-11-07 01:41:04,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:41:04,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:41:04,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:41:04,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:41:04,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:41:03" (1/3) ... [2021-11-07 01:41:04,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c75718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:41:04, skipping insertion in model container [2021-11-07 01:41:04,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:03" (2/3) ... [2021-11-07 01:41:04,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c75718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:41:04, skipping insertion in model container [2021-11-07 01:41:04,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:04" (3/3) ... [2021-11-07 01:41:04,900 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-2.i [2021-11-07 01:41:04,907 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:41:04,908 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2021-11-07 01:41:04,977 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:41:04,987 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-07 01:41:04,987 INFO L340 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2021-11-07 01:41:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 40 states have (on average 2.55) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 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-07 01:41:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-07 01:41:05,021 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:05,021 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-07 01:41:05,022 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash 6948, now seen corresponding path program 1 times [2021-11-07 01:41:05,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:05,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964182170] [2021-11-07 01:41:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:05,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:05,272 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-07 01:41:05,273 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:05,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964182170] [2021-11-07 01:41:05,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964182170] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:05,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:05,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 01:41:05,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378276602] [2021-11-07 01:41:05,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:41:05,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:05,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:41:05,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:41:05,317 INFO L87 Difference]: Start difference. First operand has 90 states, 40 states have (on average 2.55) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-07 01:41:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:05,533 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2021-11-07 01:41:05,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:41:05,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-11-07 01:41:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:05,549 INFO L225 Difference]: With dead ends: 91 [2021-11-07 01:41:05,550 INFO L226 Difference]: Without dead ends: 89 [2021-11-07 01:41:05,553 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-07 01:41:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-07 01:41:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2021-11-07 01:41:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 39 states have (on average 2.358974358974359) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:41:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-11-07 01:41:05,617 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 2 [2021-11-07 01:41:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:05,618 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-11-07 01:41:05,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-07 01:41:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-11-07 01:41:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-07 01:41:05,619 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:05,619 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-07 01:41:05,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:41:05,620 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:05,627 INFO L85 PathProgramCache]: Analyzing trace with hash 6949, now seen corresponding path program 1 times [2021-11-07 01:41:05,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:05,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134027610] [2021-11-07 01:41:05,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:05,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:05,694 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-07 01:41:05,694 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:05,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134027610] [2021-11-07 01:41:05,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134027610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:05,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:05,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 01:41:05,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811232448] [2021-11-07 01:41:05,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:41:05,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:41:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:41:05,699 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-07 01:41:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:05,859 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2021-11-07 01:41:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:41:05,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-11-07 01:41:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:05,862 INFO L225 Difference]: With dead ends: 108 [2021-11-07 01:41:05,862 INFO L226 Difference]: Without dead ends: 108 [2021-11-07 01:41:05,863 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-07 01:41:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-07 01:41:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2021-11-07 01:41:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 83 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 01:41:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2021-11-07 01:41:05,874 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 2 [2021-11-07 01:41:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:05,875 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2021-11-07 01:41:05,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-07 01:41:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2021-11-07 01:41:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 01:41:05,876 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:05,876 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 01:41:05,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:41:05,877 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2126705355, now seen corresponding path program 1 times [2021-11-07 01:41:05,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:05,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461654338] [2021-11-07 01:41:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:05,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:05,961 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-07 01:41:05,962 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:05,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461654338] [2021-11-07 01:41:05,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461654338] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:05,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:05,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:41:05,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182169376] [2021-11-07 01:41:05,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:41:05,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:41:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:41:05,965 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-07 01:41:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:06,169 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2021-11-07 01:41:06,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:41:06,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-11-07 01:41:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:06,173 INFO L225 Difference]: With dead ends: 85 [2021-11-07 01:41:06,174 INFO L226 Difference]: Without dead ends: 85 [2021-11-07 01:41:06,174 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:41:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-07 01:41:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2021-11-07 01:41:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 01:41:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2021-11-07 01:41:06,183 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 6 [2021-11-07 01:41:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:06,183 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2021-11-07 01:41:06,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-07 01:41:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2021-11-07 01:41:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 01:41:06,184 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:06,184 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 01:41:06,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:41:06,185 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2126705356, now seen corresponding path program 1 times [2021-11-07 01:41:06,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:06,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728059570] [2021-11-07 01:41:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:06,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:06,278 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-07 01:41:06,278 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:06,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728059570] [2021-11-07 01:41:06,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728059570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:06,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:06,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:41:06,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014943784] [2021-11-07 01:41:06,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:41:06,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:41:06,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:41:06,281 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-07 01:41:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:06,557 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2021-11-07 01:41:06,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:41:06,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-11-07 01:41:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:06,561 INFO L225 Difference]: With dead ends: 122 [2021-11-07 01:41:06,562 INFO L226 Difference]: Without dead ends: 122 [2021-11-07 01:41:06,565 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:41:06,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-11-07 01:41:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2021-11-07 01:41:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 102 states have internal predecessors, (131), 0 states have call successors, (0), 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-07 01:41:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2021-11-07 01:41:06,594 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 6 [2021-11-07 01:41:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:06,595 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2021-11-07 01:41:06,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-07 01:41:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2021-11-07 01:41:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 01:41:06,596 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:06,597 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:06,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:41:06,597 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:06,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash -640416460, now seen corresponding path program 1 times [2021-11-07 01:41:06,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:06,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850296248] [2021-11-07 01:41:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:06,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:06,714 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-07 01:41:06,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:06,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850296248] [2021-11-07 01:41:06,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850296248] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:06,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:06,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:41:06,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905628923] [2021-11-07 01:41:06,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:41:06,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:06,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:41:06,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:41:06,718 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-07 01:41:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:06,886 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2021-11-07 01:41:06,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:41:06,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-11-07 01:41:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:06,888 INFO L225 Difference]: With dead ends: 102 [2021-11-07 01:41:06,888 INFO L226 Difference]: Without dead ends: 102 [2021-11-07 01:41:06,888 INFO L786 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-07 01:41:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-07 01:41:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-11-07 01:41:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.7808219178082192) internal successors, (130), 101 states have internal predecessors, (130), 0 states have call successors, (0), 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-07 01:41:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions. [2021-11-07 01:41:06,897 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 8 [2021-11-07 01:41:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:06,898 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions. [2021-11-07 01:41:06,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-07 01:41:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2021-11-07 01:41:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 01:41:06,899 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:06,899 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:06,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:41:06,900 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash -640416459, now seen corresponding path program 1 times [2021-11-07 01:41:06,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:06,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600393366] [2021-11-07 01:41:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:06,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:07,003 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-07 01:41:07,004 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:07,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600393366] [2021-11-07 01:41:07,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600393366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:07,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:07,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:41:07,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899116538] [2021-11-07 01:41:07,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:41:07,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:07,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:41:07,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:41:07,008 INFO L87 Difference]: Start difference. First operand 102 states and 130 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-07 01:41:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:07,240 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2021-11-07 01:41:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:41:07,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-11-07 01:41:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:07,242 INFO L225 Difference]: With dead ends: 100 [2021-11-07 01:41:07,242 INFO L226 Difference]: Without dead ends: 100 [2021-11-07 01:41:07,242 INFO L786 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-07 01:41:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-07 01:41:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-11-07 01:41:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 93 states have internal predecessors, (121), 0 states have call successors, (0), 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-07 01:41:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2021-11-07 01:41:07,249 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 8 [2021-11-07 01:41:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:07,255 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2021-11-07 01:41:07,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-07 01:41:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2021-11-07 01:41:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:41:07,269 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:07,269 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:07,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:41:07,270 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:07,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1836477968, now seen corresponding path program 1 times [2021-11-07 01:41:07,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:07,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791378076] [2021-11-07 01:41:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:07,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:07,417 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-07 01:41:07,418 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:07,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791378076] [2021-11-07 01:41:07,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791378076] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:07,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:07,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:41:07,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142502634] [2021-11-07 01:41:07,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:41:07,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:41:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:41:07,422 INFO L87 Difference]: Start difference. First operand 94 states and 121 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-07 01:41:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:07,608 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2021-11-07 01:41:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:41:07,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-07 01:41:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:07,610 INFO L225 Difference]: With dead ends: 115 [2021-11-07 01:41:07,610 INFO L226 Difference]: Without dead ends: 115 [2021-11-07 01:41:07,611 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-07 01:41:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-07 01:41:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 82. [2021-11-07 01:41:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 81 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:41:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2021-11-07 01:41:07,618 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 11 [2021-11-07 01:41:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:07,619 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2021-11-07 01:41:07,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-07 01:41:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2021-11-07 01:41:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:41:07,620 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:07,621 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:07,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:41:07,621 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1361772281, now seen corresponding path program 1 times [2021-11-07 01:41:07,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:07,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603249707] [2021-11-07 01:41:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:07,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:41:07,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:07,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603249707] [2021-11-07 01:41:07,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603249707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:07,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:07,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:41:07,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111280711] [2021-11-07 01:41:07,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:41:07,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:07,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:41:07,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:41:07,718 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-07 01:41:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:07,881 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2021-11-07 01:41:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:41:07,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-07 01:41:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:07,883 INFO L225 Difference]: With dead ends: 92 [2021-11-07 01:41:07,883 INFO L226 Difference]: Without dead ends: 92 [2021-11-07 01:41:07,884 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:41:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-07 01:41:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2021-11-07 01:41:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 87 states have internal predecessors, (103), 0 states have call successors, (0), 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-07 01:41:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2021-11-07 01:41:07,890 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 12 [2021-11-07 01:41:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:07,891 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2021-11-07 01:41:07,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-07 01:41:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2021-11-07 01:41:07,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:41:07,892 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:07,892 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:07,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:41:07,893 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:07,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash -732736290, now seen corresponding path program 1 times [2021-11-07 01:41:07,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:07,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377956404] [2021-11-07 01:41:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:07,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:07,980 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-07 01:41:07,987 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:07,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377956404] [2021-11-07 01:41:07,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377956404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:07,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:07,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:41:07,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764543077] [2021-11-07 01:41:07,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:41:07,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:07,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:41:07,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:41:07,993 INFO L87 Difference]: Start difference. First operand 88 states and 103 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-07 01:41:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:08,125 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2021-11-07 01:41:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:41:08,126 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-07 01:41:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:08,127 INFO L225 Difference]: With dead ends: 87 [2021-11-07 01:41:08,128 INFO L226 Difference]: Without dead ends: 87 [2021-11-07 01:41:08,128 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:41:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-07 01:41:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-11-07 01:41:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 86 states have internal predecessors, (101), 0 states have call successors, (0), 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-07 01:41:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2021-11-07 01:41:08,134 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 13 [2021-11-07 01:41:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:08,135 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2021-11-07 01:41:08,135 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-07 01:41:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2021-11-07 01:41:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:41:08,137 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:08,137 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:08,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:41:08,138 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash -732736289, now seen corresponding path program 1 times [2021-11-07 01:41:08,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:08,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090197367] [2021-11-07 01:41:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:08,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:08,219 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-07 01:41:08,219 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:08,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090197367] [2021-11-07 01:41:08,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090197367] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:08,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:08,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:41:08,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041912296] [2021-11-07 01:41:08,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:41:08,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:41:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:41:08,223 INFO L87 Difference]: Start difference. First operand 87 states and 101 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-07 01:41:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:08,361 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2021-11-07 01:41:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:41:08,362 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-07 01:41:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:08,363 INFO L225 Difference]: With dead ends: 86 [2021-11-07 01:41:08,363 INFO L226 Difference]: Without dead ends: 86 [2021-11-07 01:41:08,364 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:41:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-07 01:41:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-11-07 01:41:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.5714285714285714) internal successors, (99), 85 states have internal predecessors, (99), 0 states have call successors, (0), 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-07 01:41:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2021-11-07 01:41:08,368 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 13 [2021-11-07 01:41:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:08,368 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2021-11-07 01:41:08,369 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-07 01:41:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2021-11-07 01:41:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:41:08,370 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:08,370 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:08,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:41:08,370 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1221779741, now seen corresponding path program 1 times [2021-11-07 01:41:08,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:08,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121934132] [2021-11-07 01:41:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:08,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:08,539 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-07 01:41:08,539 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:08,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121934132] [2021-11-07 01:41:08,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121934132] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:41:08,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153983525] [2021-11-07 01:41:08,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:08,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:41:08,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:41:08,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:41:08,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:41:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:08,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-07 01:41:08,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:41:08,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-07 01:41:08,861 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-07 01:41:08,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-07 01:41:09,014 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-07 01:41:09,183 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 30 treesize of output 18 [2021-11-07 01:41:09,218 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-07 01:41:09,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:41:09,366 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-07 01:41:09,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153983525] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:41:09,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1580347704] [2021-11-07 01:41:09,391 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-07 01:41:09,391 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:41:09,397 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-07 01:41:09,403 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-07 01:41:09,404 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-07 01:41:09,444 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,446 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:09,447 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,448 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-11-07 01:41:09,449 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:09,450 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,452 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-11-07 01:41:09,455 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-11-07 01:41:09,470 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_91|], 10=[|v_#valid_100|]} [2021-11-07 01:41:09,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-11-07 01:41:09,485 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,486 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:41:09,488 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,489 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:41:09,489 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:09,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-07 01:41:09,551 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,553 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:41:09,554 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,555 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:41:09,555 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:09,564 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,566 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,568 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 97 [2021-11-07 01:41:09,569 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,570 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:97 [2021-11-07 01:41:09,576 INFO L180 QuantifierPusher]: treesize reduction 3, result has 98.0 percent of original size [2021-11-07 01:41:09,578 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:09,580 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,585 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-11-07 01:41:09,587 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:09,587 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,588 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-11-07 01:41:09,589 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:09,590 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,590 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-11-07 01:41:09,598 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 150 [2021-11-07 01:41:09,611 INFO L446 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_73|, |v_#memory_$Pointer$.base_74|], 6=[|v_#memory_int_54|]} [2021-11-07 01:41:09,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 01:41:09,620 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,620 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:09,621 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,621 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:09,622 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:09,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-07 01:41:09,641 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,641 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:09,642 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,642 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:09,643 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:09,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-07 01:41:09,674 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,677 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:41:09,678 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,679 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-07 01:41:09,679 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:09,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,704 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,707 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2021-11-07 01:41:09,710 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,711 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:146, output treesize:123 [2021-11-07 01:41:09,720 INFO L180 QuantifierPusher]: treesize reduction 12, result has 93.8 percent of original size [2021-11-07 01:41:09,723 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:09,724 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,726 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-11-07 01:41:09,728 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:09,729 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,730 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-11-07 01:41:09,731 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:09,732 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,733 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-11-07 01:41:09,738 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 186 [2021-11-07 01:41:09,763 INFO L446 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_75|, |v_#memory_$Pointer$.offset_74|], 6=[|v_#memory_int_55|]} [2021-11-07 01:41:09,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-07 01:41:09,785 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,786 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:09,787 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,787 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:09,788 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:09,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-07 01:41:09,825 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,826 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:09,826 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,827 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:09,827 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:09,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-07 01:41:09,872 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,876 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-07 01:41:09,877 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,878 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-07 01:41:09,879 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:09,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,890 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,894 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 138 [2021-11-07 01:41:09,894 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,895 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:180, output treesize:138 [2021-11-07 01:41:09,907 INFO L180 QuantifierPusher]: treesize reduction 8, result has 94.7 percent of original size [2021-11-07 01:41:09,911 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 138 [2021-11-07 01:41:09,925 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,935 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:09,936 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,937 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-11-07 01:41:09,941 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2021-11-07 01:41:09,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:09,971 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 01:41:09,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2021-11-07 01:41:09,973 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,976 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-11-07 01:41:09,977 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,978 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-11-07 01:41:09,979 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:09,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:09,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:09,998 INFO L180 QuantifierPusher]: treesize reduction 3, result has 98.0 percent of original size [2021-11-07 01:41:10,006 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 146 [2021-11-07 01:41:10,007 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:41:10,007 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:154, output treesize:146 [2021-11-07 01:41:10,027 INFO L180 QuantifierPusher]: treesize reduction 5, result has 97.7 percent of original size [2021-11-07 01:41:10,036 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,037 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,038 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-11-07 01:41:10,039 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,040 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,040 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-11-07 01:41:10,041 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,044 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,045 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-11-07 01:41:10,054 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 215 [2021-11-07 01:41:10,064 INFO L446 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_75|, |v_#memory_$Pointer$.base_76|], 12=[|v_#memory_int_56|]} [2021-11-07 01:41:10,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-07 01:41:10,081 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,083 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:10,083 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,084 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:10,084 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:10,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:10,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-11-07 01:41:10,114 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,115 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:10,116 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,117 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-07 01:41:10,117 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:10,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:10,131 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-07 01:41:10,158 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,161 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-11-07 01:41:10,162 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,163 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-11-07 01:41:10,163 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:10,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:10,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,181 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,185 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2021-11-07 01:41:10,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:41:10,186 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:209, output treesize:167 [2021-11-07 01:41:10,196 INFO L180 QuantifierPusher]: treesize reduction 10, result has 95.5 percent of original size [2021-11-07 01:41:10,223 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,233 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,234 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,235 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,236 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-11-07 01:41:10,237 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-11-07 01:41:10,239 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,240 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,241 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,242 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,243 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-11-07 01:41:10,244 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-11-07 01:41:10,245 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,246 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,247 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,248 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,249 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-11-07 01:41:10,252 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-11-07 01:41:10,252 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,254 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,256 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,257 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,258 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,259 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,260 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-11-07 01:41:10,261 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-11-07 01:41:10,261 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,263 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,267 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-11-07 01:41:10,268 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-11-07 01:41:10,272 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:41:10,274 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,275 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 118 [2021-11-07 01:41:10,279 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 207 [2021-11-07 01:41:10,287 INFO L446 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_77|, |v_#memory_$Pointer$.offset_76|], 20=[|v_#memory_int_57|]} [2021-11-07 01:41:10,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-07 01:41:10,303 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,305 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-11-07 01:41:10,306 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,307 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-11-07 01:41:10,307 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:10,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:10,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-07 01:41:10,336 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,338 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-11-07 01:41:10,338 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,339 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-11-07 01:41:10,340 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:10,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:10,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:41:10,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2021-11-07 01:41:10,384 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,389 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-11-07 01:41:10,390 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,391 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-11-07 01:41:10,393 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-07 01:41:10,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:41:10,404 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,408 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,413 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 211 [2021-11-07 01:41:10,414 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:41:10,414 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:205, output treesize:211 [2021-11-07 01:41:10,425 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,433 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 211 [2021-11-07 01:41:10,446 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:41:10,452 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 238 [2021-11-07 01:41:10,466 INFO L180 QuantifierPusher]: treesize reduction 12, result has 95.4 percent of original size [2021-11-07 01:41:10,472 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-11-07 01:41:10,476 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-07 01:41:12,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1580347704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:12,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:41:12,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 5, 5] total 20 [2021-11-07 01:41:12,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297049958] [2021-11-07 01:41:12,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 01:41:12,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 01:41:12,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:41:12,784 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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-07 01:41:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:13,447 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2021-11-07 01:41:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:41:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-07 01:41:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:13,458 INFO L225 Difference]: With dead ends: 93 [2021-11-07 01:41:13,458 INFO L226 Difference]: Without dead ends: 93 [2021-11-07 01:41:13,459 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:41:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-07 01:41:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-11-07 01:41:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 90 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:41:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2021-11-07 01:41:13,465 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 14 [2021-11-07 01:41:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:13,465 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2021-11-07 01:41:13,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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-07 01:41:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2021-11-07 01:41:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:41:13,467 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:13,467 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:13,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:41:13,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-07 01:41:13,693 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:13,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 215172338, now seen corresponding path program 1 times [2021-11-07 01:41:13,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:13,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578520956] [2021-11-07 01:41:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:13,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:13,808 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-07 01:41:13,809 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:13,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578520956] [2021-11-07 01:41:13,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578520956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:13,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:13,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 01:41:13,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225453137] [2021-11-07 01:41:13,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 01:41:13,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:13,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 01:41:13,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:41:13,811 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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-07 01:41:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:14,112 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2021-11-07 01:41:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:41:14,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-07 01:41:14,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:14,118 INFO L225 Difference]: With dead ends: 94 [2021-11-07 01:41:14,118 INFO L226 Difference]: Without dead ends: 94 [2021-11-07 01:41:14,119 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-11-07 01:41:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-07 01:41:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2021-11-07 01:41:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 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-07 01:41:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-11-07 01:41:14,130 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 15 [2021-11-07 01:41:14,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:14,131 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-11-07 01:41:14,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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-07 01:41:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-11-07 01:41:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:41:14,139 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:14,139 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:14,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 01:41:14,139 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:14,140 INFO L85 PathProgramCache]: Analyzing trace with hash 215172339, now seen corresponding path program 1 times [2021-11-07 01:41:14,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:14,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095263212] [2021-11-07 01:41:14,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:14,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:14,338 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-07 01:41:14,339 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:14,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095263212] [2021-11-07 01:41:14,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095263212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:14,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:14,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 01:41:14,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716622465] [2021-11-07 01:41:14,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 01:41:14,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 01:41:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:41:14,342 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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-07 01:41:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:14,644 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2021-11-07 01:41:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:41:14,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-07 01:41:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:14,646 INFO L225 Difference]: With dead ends: 92 [2021-11-07 01:41:14,646 INFO L226 Difference]: Without dead ends: 92 [2021-11-07 01:41:14,646 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:41:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-07 01:41:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2021-11-07 01:41:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.5) internal successors, (102), 88 states have internal predecessors, (102), 0 states have call successors, (0), 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-07 01:41:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2021-11-07 01:41:14,649 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 15 [2021-11-07 01:41:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:14,649 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2021-11-07 01:41:14,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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-07 01:41:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2021-11-07 01:41:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:41:14,650 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:14,650 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:14,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 01:41:14,651 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:14,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash -779588494, now seen corresponding path program 1 times [2021-11-07 01:41:14,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:14,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281277389] [2021-11-07 01:41:14,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:14,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:14,724 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-07 01:41:14,724 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:14,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281277389] [2021-11-07 01:41:14,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281277389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:14,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:14,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:41:14,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043716608] [2021-11-07 01:41:14,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:41:14,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:14,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:41:14,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:41:14,727 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-07 01:41:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:14,987 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2021-11-07 01:41:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:41:14,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-07 01:41:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:14,989 INFO L225 Difference]: With dead ends: 125 [2021-11-07 01:41:14,990 INFO L226 Difference]: Without dead ends: 125 [2021-11-07 01:41:14,990 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-07 01:41:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-07 01:41:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2021-11-07 01:41:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 93 states have internal predecessors, (110), 0 states have call successors, (0), 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-07 01:41:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2021-11-07 01:41:14,994 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 15 [2021-11-07 01:41:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:14,994 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2021-11-07 01:41:14,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-07 01:41:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2021-11-07 01:41:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:41:14,995 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:14,995 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:14,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 01:41:14,996 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash -779588493, now seen corresponding path program 1 times [2021-11-07 01:41:14,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:14,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252164752] [2021-11-07 01:41:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:14,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:15,127 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-07 01:41:15,128 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:15,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252164752] [2021-11-07 01:41:15,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252164752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:15,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:15,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:41:15,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823041081] [2021-11-07 01:41:15,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:41:15,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:15,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:41:15,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:41:15,131 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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-07 01:41:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:15,575 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2021-11-07 01:41:15,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:41:15,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-07 01:41:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:15,577 INFO L225 Difference]: With dead ends: 137 [2021-11-07 01:41:15,577 INFO L226 Difference]: Without dead ends: 137 [2021-11-07 01:41:15,578 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:41:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-07 01:41:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2021-11-07 01:41:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 113 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-07 01:41:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2021-11-07 01:41:15,594 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 15 [2021-11-07 01:41:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:15,594 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2021-11-07 01:41:15,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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-07 01:41:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2021-11-07 01:41:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 01:41:15,597 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:15,597 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:15,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 01:41:15,598 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1602639886, now seen corresponding path program 1 times [2021-11-07 01:41:15,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:15,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856159856] [2021-11-07 01:41:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:15,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:41:15,666 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-07 01:41:15,667 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:41:15,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856159856] [2021-11-07 01:41:15,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856159856] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:41:15,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:41:15,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:41:15,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807657863] [2021-11-07 01:41:15,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:41:15,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:41:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:41:15,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:41:15,670 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-07 01:41:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:41:15,910 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2021-11-07 01:41:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:41:15,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-11-07 01:41:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:41:15,912 INFO L225 Difference]: With dead ends: 139 [2021-11-07 01:41:15,912 INFO L226 Difference]: Without dead ends: 139 [2021-11-07 01:41:15,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:41:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-07 01:41:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 114. [2021-11-07 01:41:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 113 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:41:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2021-11-07 01:41:15,918 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 16 [2021-11-07 01:41:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:41:15,918 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2021-11-07 01:41:15,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-07 01:41:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2021-11-07 01:41:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 01:41:15,919 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:41:15,919 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:15,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 01:41:15,920 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 45 more)] === [2021-11-07 01:41:15,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:41:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1860229865, now seen corresponding path program 1 times [2021-11-07 01:41:15,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:41:15,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181435320] [2021-11-07 01:41:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:41:15,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:41:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:41:15,952 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:41:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:41:16,012 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:41:16,012 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:41:16,014 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:41:16,017 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-07 01:41:16,017 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-07 01:41:16,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-07 01:41:16,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-07 01:41:16,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-07 01:41:16,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-07 01:41:16,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-07 01:41:16,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-07 01:41:16,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-07 01:41:16,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-07 01:41:16,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-07 01:41:16,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-07 01:41:16,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-07 01:41:16,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-07 01:41:16,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-07 01:41:16,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-07 01:41:16,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-07 01:41:16,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-07 01:41:16,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-07 01:41:16,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-07 01:41:16,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-07 01:41:16,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-07 01:41:16,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-07 01:41:16,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-07 01:41:16,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-07 01:41:16,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-07 01:41:16,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-07 01:41:16,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-07 01:41:16,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-07 01:41:16,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-07 01:41:16,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-07 01:41:16,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-07 01:41:16,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-07 01:41:16,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-07 01:41:16,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-07 01:41:16,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-07 01:41:16,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-07 01:41:16,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-07 01:41:16,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-07 01:41:16,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-07 01:41:16,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-07 01:41:16,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-07 01:41:16,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-07 01:41:16,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-11-07 01:41:16,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:41:16,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:41:16,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:41:16,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:41:16,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 01:41:16,030 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:41:16,036 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:41:16,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:41:16 BoogieIcfgContainer [2021-11-07 01:41:16,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:41:16,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:41:16,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:41:16,082 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:41:16,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:04" (3/4) ... [2021-11-07 01:41:16,085 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:41:16,163 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:41:16,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:41:16,164 INFO L168 Benchmark]: Toolchain (without parser) took 12934.06 ms. Allocated memory was 104.9 MB in the beginning and 180.4 MB in the end (delta: 75.5 MB). Free memory was 75.8 MB in the beginning and 155.5 MB in the end (delta: -79.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 16.1 GB. [2021-11-07 01:41:16,164 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 83.9 MB. Free memory is still 49.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:41:16,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.10 ms. Allocated memory is still 104.9 MB. Free memory was 75.6 MB in the beginning and 58.9 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-07 01:41:16,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.80 ms. Allocated memory is still 104.9 MB. Free memory was 58.9 MB in the beginning and 56.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:41:16,166 INFO L168 Benchmark]: Boogie Preprocessor took 38.82 ms. Allocated memory is still 104.9 MB. Free memory was 56.8 MB in the beginning and 55.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:41:16,167 INFO L168 Benchmark]: RCFGBuilder took 956.02 ms. Allocated memory is still 104.9 MB. Free memory was 55.0 MB in the beginning and 78.5 MB in the end (delta: -23.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.1 GB. [2021-11-07 01:41:16,167 INFO L168 Benchmark]: TraceAbstraction took 11190.33 ms. Allocated memory was 104.9 MB in the beginning and 180.4 MB in the end (delta: 75.5 MB). Free memory was 78.0 MB in the beginning and 125.1 MB in the end (delta: -47.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:41:16,167 INFO L168 Benchmark]: Witness Printer took 81.39 ms. Allocated memory is still 180.4 MB. Free memory was 125.1 MB in the beginning and 155.5 MB in the end (delta: -30.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:41:16,176 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 83.9 MB. Free memory is still 49.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 577.10 ms. Allocated memory is still 104.9 MB. Free memory was 75.6 MB in the beginning and 58.9 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.80 ms. Allocated memory is still 104.9 MB. Free memory was 58.9 MB in the beginning and 56.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.82 ms. Allocated memory is still 104.9 MB. Free memory was 56.8 MB in the beginning and 55.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 956.02 ms. Allocated memory is still 104.9 MB. Free memory was 55.0 MB in the beginning and 78.5 MB in the end (delta: -23.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11190.33 ms. Allocated memory was 104.9 MB in the beginning and 180.4 MB in the end (delta: 75.5 MB). Free memory was 78.0 MB in the beginning and 125.1 MB in the end (delta: -47.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 16.1 GB. * Witness Printer took 81.39 ms. Allocated memory is still 180.4 MB. Free memory was 125.1 MB in the beginning and 155.5 MB in the end (delta: -30.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1053]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L999] SLL* head = malloc(sizeof(SLL)); [L1000] head->next = ((void*)0) [L1001] head->data = 0 [L1003] SLL* x = head; [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1016] COND TRUE __VERIFIER_nondet_int() [L1017] x = malloc(sizeof(SLL)) [L1018] x->data = 1 [L1019] x->next = head [L1020] head = x [L1040] x = head [L1043] EXPR x->data [L1043] COND FALSE !(x->data != 1) [L1049] EXPR x->next [L1049] x = x->next [L1050] COND TRUE \read(*x) [L1052] EXPR x->data [L1052] COND TRUE x->data != 1 [L1053] reach_error() - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 49 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 697 SDtfs, 1212 SDslu, 867 SDs, 0 SdLazy, 2611 SolverSat, 367 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=15, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 184 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 181 ConstructedInterpolants, 7 QuantifiedInterpolants, 1354 SizeOfPredicates, 6 NumberOfNonLiveVariables, 103 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME[ms]: 1087, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 13, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 16, TOOLS_POST_TIME[ms]: 998, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 14, TOOLS_QUANTIFIERELIM_TIME[ms]: 988, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 225, FLUID_QUERY_TIME[ms]: 5, FLUID_QUERIES: 33, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME[ms]: 0, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 13, DOMAIN_ISBOTTOM_TIME[ms]: 32, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 19, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 19, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 4, DAG_COMPRESSION_TIME[ms]: 12, DAG_COMPRESSION_PROCESSED_NODES: 161, DAG_COMPRESSION_RETAINED_NODES: 38, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 01:41:16,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7cae828-f99b-4f4b-8006-b40f0996bd6c/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)