./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/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_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:07:37,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:07:37,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:07:37,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:07:37,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:07:37,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:07:37,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:07:37,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:07:37,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:07:37,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:07:37,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:07:37,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:07:37,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:07:37,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:07:37,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:07:37,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:07:37,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:07:37,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:07:37,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:07:37,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:07:37,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:07:37,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:07:37,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:07:37,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:07:37,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:07:37,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:07:37,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:07:37,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:07:37,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:07:37,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:07:37,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:07:37,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:07:37,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:07:37,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:07:37,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:07:37,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:07:37,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:07:37,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:07:37,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:07:37,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:07:37,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:07:37,831 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-07 01:07:37,878 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:07:37,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:07:37,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:07:37,886 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:07:37,887 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:07:37,887 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:07:37,887 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:07:37,888 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:07:37,888 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:07:37,888 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:07:37,889 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:07:37,889 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:07:37,890 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:07:37,890 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:07:37,890 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:07:37,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 01:07:37,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 01:07:37,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:07:37,893 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:07:37,893 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 01:07:37,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:07:37,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:07:37,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:07:37,894 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 01:07:37,894 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 01:07:37,894 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-07 01:07:37,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:07:37,896 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:07:37,896 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:07:37,896 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:07:37,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:07:37,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:07:37,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:07:37,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:07:37,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:07:37,898 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:07:37,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:07:37,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:07:37,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:07:37,899 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_68595062-2953-40d0-8982-d2d1cf3d06c3/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_68595062-2953-40d0-8982-d2d1cf3d06c3/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2021-11-07 01:07:38,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:07:38,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:07:38,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:07:38,282 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:07:38,283 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:07:38,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2021-11-07 01:07:38,375 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/data/164f2dc02/46ca4fa1b11a4d7e9ca9f81a19d8a289/FLAG7f3c50d02 [2021-11-07 01:07:38,828 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:07:38,829 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2021-11-07 01:07:38,836 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/data/164f2dc02/46ca4fa1b11a4d7e9ca9f81a19d8a289/FLAG7f3c50d02 [2021-11-07 01:07:39,216 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/data/164f2dc02/46ca4fa1b11a4d7e9ca9f81a19d8a289 [2021-11-07 01:07:39,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:07:39,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:07:39,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:07:39,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:07:39,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:07:39,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b26b8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39, skipping insertion in model container [2021-11-07 01:07:39,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:07:39,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:07:39,461 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_68595062-2953-40d0-8982-d2d1cf3d06c3/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2021-11-07 01:07:39,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:07:39,498 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:07:39,510 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_68595062-2953-40d0-8982-d2d1cf3d06c3/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2021-11-07 01:07:39,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:07:39,536 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:07:39,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39 WrapperNode [2021-11-07 01:07:39,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:07:39,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:07:39,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:07:39,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:07:39,547 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:07:39" (1/1) ... [2021-11-07 01:07:39,555 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:07:39" (1/1) ... [2021-11-07 01:07:39,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:07:39,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:07:39,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:07:39,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:07:39,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:07:39,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:07:39,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:07:39,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:07:39,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39" (1/1) ... [2021-11-07 01:07:39,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:07:39,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:07:39,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:07:39,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:07:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:07:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-11-07 01:07:39,704 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-11-07 01:07:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:07:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 01:07:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:07:39,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:07:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 01:07:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:07:40,340 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:07:40,341 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-11-07 01:07:40,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:40 BoogieIcfgContainer [2021-11-07 01:07:40,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:07:40,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:07:40,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:07:40,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:07:40,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:07:39" (1/3) ... [2021-11-07 01:07:40,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd5b81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:40, skipping insertion in model container [2021-11-07 01:07:40,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:39" (2/3) ... [2021-11-07 01:07:40,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd5b81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:40, skipping insertion in model container [2021-11-07 01:07:40,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:40" (3/3) ... [2021-11-07 01:07:40,354 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2021-11-07 01:07:40,359 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:07:40,381 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2021-11-07 01:07:40,438 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:07:40,444 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:07:40,445 INFO L340 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2021-11-07 01:07:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-07 01:07:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 01:07:40,468 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:40,468 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 01:07:40,469 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:40,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:40,475 INFO L85 PathProgramCache]: Analyzing trace with hash 150466673, now seen corresponding path program 1 times [2021-11-07 01:07:40,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:40,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215327418] [2021-11-07 01:07:40,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:40,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:40,717 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:07:40,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:40,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215327418] [2021-11-07 01:07:40,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215327418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:40,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:40,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:07:40,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395983446] [2021-11-07 01:07:40,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:07:40,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:07:40,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:07:40,743 INFO L87 Difference]: Start difference. First operand has 47 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:40,861 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-11-07 01:07:40,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:07:40,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:07:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:40,873 INFO L225 Difference]: With dead ends: 75 [2021-11-07 01:07:40,873 INFO L226 Difference]: Without dead ends: 74 [2021-11-07 01:07:40,875 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:07:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-07 01:07:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2021-11-07 01:07:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 54 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2021-11-07 01:07:40,916 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 6 [2021-11-07 01:07:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:40,917 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2021-11-07 01:07:40,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2021-11-07 01:07:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:07:40,918 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:40,918 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:40,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:07:40,919 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash 369505433, now seen corresponding path program 1 times [2021-11-07 01:07:40,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:40,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724144359] [2021-11-07 01:07:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:40,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:40,989 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:07:40,989 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:40,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724144359] [2021-11-07 01:07:40,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724144359] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:40,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:40,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:07:40,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762993874] [2021-11-07 01:07:40,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:07:40,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:40,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:07:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:07:40,994 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:41,089 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2021-11-07 01:07:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:07:41,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-07 01:07:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:41,094 INFO L225 Difference]: With dead ends: 53 [2021-11-07 01:07:41,094 INFO L226 Difference]: Without dead ends: 53 [2021-11-07 01:07:41,095 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:07:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-07 01:07:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-07 01:07:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.5) internal successors, (54), 47 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2021-11-07 01:07:41,104 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 7 [2021-11-07 01:07:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:41,105 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2021-11-07 01:07:41,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2021-11-07 01:07:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:07:41,105 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:41,105 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:41,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:07:41,106 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash 369505434, now seen corresponding path program 1 times [2021-11-07 01:07:41,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:41,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628760322] [2021-11-07 01:07:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:41,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:41,291 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:07:41,292 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:41,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628760322] [2021-11-07 01:07:41,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628760322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:41,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:41,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:07:41,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978604842] [2021-11-07 01:07:41,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:07:41,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:07:41,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:07:41,297 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:41,503 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-11-07 01:07:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:07:41,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-07 01:07:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:41,505 INFO L225 Difference]: With dead ends: 59 [2021-11-07 01:07:41,506 INFO L226 Difference]: Without dead ends: 59 [2021-11-07 01:07:41,506 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:07:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-07 01:07:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2021-11-07 01:07:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2021-11-07 01:07:41,514 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 7 [2021-11-07 01:07:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:41,515 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2021-11-07 01:07:41,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2021-11-07 01:07:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 01:07:41,516 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:41,516 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:41,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:07:41,517 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:41,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1429953388, now seen corresponding path program 1 times [2021-11-07 01:07:41,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:41,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719361259] [2021-11-07 01:07:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:41,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:41,662 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:07:41,662 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:41,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719361259] [2021-11-07 01:07:41,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719361259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:41,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:41,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:07:41,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935885040] [2021-11-07 01:07:41,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:07:41,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:41,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:07:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:07:41,665 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 4 states, 2 states have (on average 3.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:41,714 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2021-11-07 01:07:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:07:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 3.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2021-11-07 01:07:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:41,717 INFO L225 Difference]: With dead ends: 51 [2021-11-07 01:07:41,717 INFO L226 Difference]: Without dead ends: 51 [2021-11-07 01:07:41,718 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:07:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-07 01:07:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-11-07 01:07:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 45 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-11-07 01:07:41,725 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 8 [2021-11-07 01:07:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:41,726 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-11-07 01:07:41,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 3.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-11-07 01:07:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 01:07:41,727 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:41,727 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:41,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:07:41,727 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1430233423, now seen corresponding path program 1 times [2021-11-07 01:07:41,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:41,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868267255] [2021-11-07 01:07:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:41,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:41,952 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:07:41,952 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:41,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868267255] [2021-11-07 01:07:41,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868267255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:41,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:41,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:07:41,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279986345] [2021-11-07 01:07:41,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:07:41,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:41,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:07:41,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:07:41,959 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:42,139 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-11-07 01:07:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:07:42,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:07:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:42,141 INFO L225 Difference]: With dead ends: 57 [2021-11-07 01:07:42,141 INFO L226 Difference]: Without dead ends: 57 [2021-11-07 01:07:42,142 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:07:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-07 01:07:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2021-11-07 01:07:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2021-11-07 01:07:42,148 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2021-11-07 01:07:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:42,149 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2021-11-07 01:07:42,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-11-07 01:07:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:07:42,150 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:42,150 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:42,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:07:42,151 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:42,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1378879468, now seen corresponding path program 1 times [2021-11-07 01:07:42,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:42,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130742233] [2021-11-07 01:07:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:42,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:42,284 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:07:42,285 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:42,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130742233] [2021-11-07 01:07:42,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130742233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:42,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:42,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 01:07:42,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107788353] [2021-11-07 01:07:42,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:07:42,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:42,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:07:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:07:42,298 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:42,390 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2021-11-07 01:07:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:07:42,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-11-07 01:07:42,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:42,392 INFO L225 Difference]: With dead ends: 67 [2021-11-07 01:07:42,392 INFO L226 Difference]: Without dead ends: 67 [2021-11-07 01:07:42,393 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:07:42,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-07 01:07:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2021-11-07 01:07:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.35) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-07 01:07:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-11-07 01:07:42,405 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2021-11-07 01:07:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:42,406 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-11-07 01:07:42,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-11-07 01:07:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:07:42,407 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:42,407 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:42,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:07:42,408 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2041800706, now seen corresponding path program 1 times [2021-11-07 01:07:42,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:42,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091572700] [2021-11-07 01:07:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:42,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:42,533 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:07:42,534 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:42,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091572700] [2021-11-07 01:07:42,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091572700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:42,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:42,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:07:42,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927382527] [2021-11-07 01:07:42,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:07:42,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:42,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:07:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:07:42,538 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:42,617 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2021-11-07 01:07:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:07:42,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-07 01:07:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:42,619 INFO L225 Difference]: With dead ends: 54 [2021-11-07 01:07:42,619 INFO L226 Difference]: Without dead ends: 54 [2021-11-07 01:07:42,620 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:07:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-07 01:07:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-07 01:07:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-07 01:07:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2021-11-07 01:07:42,636 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 11 [2021-11-07 01:07:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:42,636 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-11-07 01:07:42,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2021-11-07 01:07:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:07:42,642 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:42,642 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:42,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:07:42,642 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1128683485, now seen corresponding path program 1 times [2021-11-07 01:07:42,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:42,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623412455] [2021-11-07 01:07:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:42,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:42,709 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:07:42,709 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:42,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623412455] [2021-11-07 01:07:42,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623412455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:42,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:42,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:07:42,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551610245] [2021-11-07 01:07:42,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:07:42,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:07:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:07:42,711 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:42,720 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-11-07 01:07:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:07:42,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-11-07 01:07:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:42,721 INFO L225 Difference]: With dead ends: 53 [2021-11-07 01:07:42,722 INFO L226 Difference]: Without dead ends: 53 [2021-11-07 01:07:42,722 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:07:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-07 01:07:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-07 01:07:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-07 01:07:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2021-11-07 01:07:42,726 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 12 [2021-11-07 01:07:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:42,726 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2021-11-07 01:07:42,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2021-11-07 01:07:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:07:42,727 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:42,727 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:42,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:07:42,728 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash -350967501, now seen corresponding path program 1 times [2021-11-07 01:07:42,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:42,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703215258] [2021-11-07 01:07:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:42,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:42,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:42,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703215258] [2021-11-07 01:07:42,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703215258] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:07:42,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009187258] [2021-11-07 01:07:42,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:42,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:07:42,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:07:42,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:07:42,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:07:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:43,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 01:07:43,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:07:43,250 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 56 treesize of output 40 [2021-11-07 01:07:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:43,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:07:43,889 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 63 treesize of output 47 [2021-11-07 01:07:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:07:44,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009187258] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:07:44,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1704693260] [2021-11-07 01:07:44,055 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-07 01:07:44,056 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:07:44,062 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:07:44,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:07:44,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 14 [2021-11-07 01:07:44,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027065760] [2021-11-07 01:07:44,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:07:44,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:07:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:07:44,068 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:44,487 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2021-11-07 01:07:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:07:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 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:07:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:44,489 INFO L225 Difference]: With dead ends: 57 [2021-11-07 01:07:44,490 INFO L226 Difference]: Without dead ends: 57 [2021-11-07 01:07:44,490 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:07:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-07 01:07:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2021-11-07 01:07:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 44 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-07 01:07:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2021-11-07 01:07:44,495 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2021-11-07 01:07:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:44,506 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2021-11-07 01:07:44,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-11-07 01:07:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:07:44,510 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:44,510 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:44,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:07:44,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-07 01:07:44,724 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:44,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2004915224, now seen corresponding path program 1 times [2021-11-07 01:07:44,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:44,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909570339] [2021-11-07 01:07:44,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:44,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:45,021 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:45,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909570339] [2021-11-07 01:07:45,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909570339] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:07:45,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918541674] [2021-11-07 01:07:45,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:45,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:07:45,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:07:45,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:07:45,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:07:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:45,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-07 01:07:45,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:07:45,148 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 7 treesize of output 6 [2021-11-07 01:07:45,354 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 78 treesize of output 70 [2021-11-07 01:07:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:45,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:07:45,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 92 treesize of output 88 [2021-11-07 01:07:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:47,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918541674] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:07:47,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1291852137] [2021-11-07 01:07:47,092 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-07 01:07:47,092 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:07:47,093 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:07:47,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:07:47,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2021-11-07 01:07:47,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788283384] [2021-11-07 01:07:47,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-07 01:07:47,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:47,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-07 01:07:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:07:47,099 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 24 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:47,957 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-11-07 01:07:47,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:07:47,958 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 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:07:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:47,959 INFO L225 Difference]: With dead ends: 56 [2021-11-07 01:07:47,959 INFO L226 Difference]: Without dead ends: 56 [2021-11-07 01:07:47,960 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 01:07:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-07 01:07:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2021-11-07 01:07:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.263157894736842) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-07 01:07:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2021-11-07 01:07:47,970 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2021-11-07 01:07:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:47,970 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2021-11-07 01:07:47,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2021-11-07 01:07:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:07:47,972 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:47,973 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:48,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:07:48,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-07 01:07:48,173 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1961899110, now seen corresponding path program 1 times [2021-11-07 01:07:48,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:48,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658004013] [2021-11-07 01:07:48,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:48,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:48,214 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:07:48,214 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:48,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658004013] [2021-11-07 01:07:48,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658004013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:07:48,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:07:48,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:07:48,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723438920] [2021-11-07 01:07:48,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:07:48,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:48,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:07:48,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:07:48,217 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:48,249 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-11-07 01:07:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:07:48,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-07 01:07:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:48,250 INFO L225 Difference]: With dead ends: 49 [2021-11-07 01:07:48,250 INFO L226 Difference]: Without dead ends: 39 [2021-11-07 01:07:48,250 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:07:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-07 01:07:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-11-07 01:07:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2021-11-07 01:07:48,253 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2021-11-07 01:07:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:48,254 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2021-11-07 01:07:48,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:07:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2021-11-07 01:07:48,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:07:48,255 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:48,255 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:48,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:07:48,255 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:48,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:48,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2023113720, now seen corresponding path program 1 times [2021-11-07 01:07:48,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:48,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110876928] [2021-11-07 01:07:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:48,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:48,351 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:48,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110876928] [2021-11-07 01:07:48,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110876928] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:07:48,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557563001] [2021-11-07 01:07:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:48,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:07:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:07:48,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:07:48,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:07:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:48,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-07 01:07:48,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:07:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:48,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:07:48,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 25 [2021-11-07 01:07:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:49,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557563001] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:07:49,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1830041845] [2021-11-07 01:07:49,167 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-07 01:07:49,168 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:07:49,168 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:07:49,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:07:49,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2021-11-07 01:07:49,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790014464] [2021-11-07 01:07:49,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 01:07:49,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:49,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 01:07:49,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:07:49,172 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:49,424 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-11-07 01:07:49,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:07:49,425 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 15 [2021-11-07 01:07:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:49,426 INFO L225 Difference]: With dead ends: 44 [2021-11-07 01:07:49,426 INFO L226 Difference]: Without dead ends: 44 [2021-11-07 01:07:49,426 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:07:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-07 01:07:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2021-11-07 01:07:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-11-07 01:07:49,429 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2021-11-07 01:07:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:49,430 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-11-07 01:07:49,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-11-07 01:07:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:07:49,431 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:49,431 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-11-07 01:07:49,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:07:49,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-07 01:07:49,632 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2022829811, now seen corresponding path program 1 times [2021-11-07 01:07:49,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:49,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283259066] [2021-11-07 01:07:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:49,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:49,870 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:49,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283259066] [2021-11-07 01:07:49,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283259066] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:07:49,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590809668] [2021-11-07 01:07:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:49,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:07:49,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:07:49,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:07:49,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 01:07:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:50,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-07 01:07:50,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:07:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:50,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:07:50,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 51 [2021-11-07 01:07:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:50,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590809668] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:07:50,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [808092943] [2021-11-07 01:07:50,920 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-07 01:07:50,920 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:07:50,921 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:07:50,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:07:50,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2021-11-07 01:07:50,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534872637] [2021-11-07 01:07:50,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-07 01:07:50,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:50,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-07 01:07:50,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:07:50,924 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:51,968 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2021-11-07 01:07:51,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:07:51,969 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (6), 6 states have call predecessors, (6), 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:07:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:51,969 INFO L225 Difference]: With dead ends: 63 [2021-11-07 01:07:51,970 INFO L226 Difference]: Without dead ends: 63 [2021-11-07 01:07:51,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2021-11-07 01:07:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-07 01:07:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2021-11-07 01:07:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 01:07:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2021-11-07 01:07:51,975 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 15 [2021-11-07 01:07:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:51,976 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2021-11-07 01:07:51,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:07:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2021-11-07 01:07:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 01:07:51,977 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:51,977 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:52,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:07:52,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:07:52,196 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1707983288, now seen corresponding path program 1 times [2021-11-07 01:07:52,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:52,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730668547] [2021-11-07 01:07:52,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:52,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:52,439 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:52,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730668547] [2021-11-07 01:07:52,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730668547] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:07:52,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149453630] [2021-11-07 01:07:52,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:52,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:07:52,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:07:52,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:07:52,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 01:07:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:52,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-07 01:07:52,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:07:52,785 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 64 treesize of output 48 [2021-11-07 01:07:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:53,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:07:53,613 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 82 treesize of output 66 [2021-11-07 01:07:53,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 66 treesize of output 62 [2021-11-07 01:07:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:53,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149453630] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:07:53,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1633566907] [2021-11-07 01:07:53,804 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-07 01:07:53,804 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:07:53,805 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:07:53,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:07:53,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2021-11-07 01:07:53,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893453104] [2021-11-07 01:07:53,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-07 01:07:53,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:07:53,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-07 01:07:53,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:07:53,808 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:07:54,968 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2021-11-07 01:07:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:07:54,969 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 16 [2021-11-07 01:07:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:07:54,970 INFO L225 Difference]: With dead ends: 85 [2021-11-07 01:07:54,970 INFO L226 Difference]: Without dead ends: 85 [2021-11-07 01:07:54,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=1905, Unknown=0, NotChecked=0, Total=2256 [2021-11-07 01:07:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-07 01:07:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2021-11-07 01:07:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 54 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-07 01:07:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2021-11-07 01:07:54,978 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 16 [2021-11-07 01:07:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:07:54,979 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2021-11-07 01:07:54,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:07:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2021-11-07 01:07:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:07:54,980 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:07:54,980 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:07:55,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-07 01:07:55,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-07 01:07:55,181 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting checkErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:07:55,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:07:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -694413414, now seen corresponding path program 1 times [2021-11-07 01:07:55,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:07:55,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127089717] [2021-11-07 01:07:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:55,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:07:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:07:55,258 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:07:55,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127089717] [2021-11-07 01:07:55,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127089717] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:07:55,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716138035] [2021-11-07 01:07:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:07:55,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:07:55,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:07:55,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:07:55,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 01:07:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:07:55,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 01:07:55,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:07:55,469 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 7 treesize of output 6 [2021-11-07 01:07:57,506 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_7 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_7))) is different from true [2021-11-07 01:07:57,587 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 47 treesize of output 41 [2021-11-07 01:07:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-07 01:07:57,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:08:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:03,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716138035] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:08:03,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1016027254] [2021-11-07 01:08:03,822 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-07 01:08:03,822 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:08:03,823 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:08:03,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:08:03,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2021-11-07 01:08:03,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655205559] [2021-11-07 01:08:03,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 01:08:03,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:03,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 01:08:03,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=147, Unknown=3, NotChecked=24, Total=210 [2021-11-07 01:08:03,825 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-07 01:08:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:03,957 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2021-11-07 01:08:03,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:08:03,958 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2021-11-07 01:08:03,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:03,959 INFO L225 Difference]: With dead ends: 63 [2021-11-07 01:08:03,959 INFO L226 Difference]: Without dead ends: 63 [2021-11-07 01:08:03,960 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=80, Invalid=227, Unknown=3, NotChecked=32, Total=342 [2021-11-07 01:08:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-07 01:08:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-11-07 01:08:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-07 01:08:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-11-07 01:08:03,966 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2021-11-07 01:08:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:03,966 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-11-07 01:08:03,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-07 01:08:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-11-07 01:08:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:08:03,967 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:03,968 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:03,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-07 01:08:04,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-07 01:08:04,172 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:08:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:04,172 INFO L85 PathProgramCache]: Analyzing trace with hash 519062902, now seen corresponding path program 2 times [2021-11-07 01:08:04,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:04,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346649389] [2021-11-07 01:08:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:04,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:04,348 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:04,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346649389] [2021-11-07 01:08:04,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346649389] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:08:04,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988128863] [2021-11-07 01:08:04,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:08:04,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:08:04,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:08:04,349 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:08:04,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 01:08:04,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-07 01:08:04,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:08:04,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-07 01:08:04,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:08:04,642 INFO L354 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2021-11-07 01:08:04,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 50 [2021-11-07 01:08:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 01:08:05,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:08:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 01:08:05,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988128863] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:08:05,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2005476818] [2021-11-07 01:08:05,419 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-07 01:08:05,420 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:08:05,420 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:08:05,420 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:08:05,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 15 [2021-11-07 01:08:05,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965065344] [2021-11-07 01:08:05,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 01:08:05,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:05,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 01:08:05,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:08:05,422 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 16 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:08:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:05,986 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2021-11-07 01:08:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:08:05,987 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2021-11-07 01:08:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:05,987 INFO L225 Difference]: With dead ends: 64 [2021-11-07 01:08:05,987 INFO L226 Difference]: Without dead ends: 64 [2021-11-07 01:08:05,988 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:08:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-07 01:08:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2021-11-07 01:08:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-07 01:08:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-11-07 01:08:05,992 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2021-11-07 01:08:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:05,992 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-11-07 01:08:05,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:08:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-11-07 01:08:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:08:05,993 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:05,993 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:06,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-07 01:08:06,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-07 01:08:06,220 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:08:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 317135144, now seen corresponding path program 1 times [2021-11-07 01:08:06,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:06,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215160717] [2021-11-07 01:08:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:06,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:08:06,591 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:06,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215160717] [2021-11-07 01:08:06,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215160717] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:08:06,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962161879] [2021-11-07 01:08:06,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:06,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:08:06,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:08:06,592 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:08:06,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 01:08:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:06,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-07 01:08:06,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:08:06,877 INFO L354 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2021-11-07 01:08:06,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2021-11-07 01:08:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:08:07,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:08:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:08:07,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962161879] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:08:07,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [274174696] [2021-11-07 01:08:08,007 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2021-11-07 01:08:08,007 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:08:08,008 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:08:08,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:08:08,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 6] total 26 [2021-11-07 01:08:08,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587112067] [2021-11-07 01:08:08,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-07 01:08:08,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:08,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-07 01:08:08,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:08:08,013 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 27 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-07 01:08:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:09,260 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-11-07 01:08:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:08:09,261 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2021-11-07 01:08:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:09,262 INFO L225 Difference]: With dead ends: 76 [2021-11-07 01:08:09,262 INFO L226 Difference]: Without dead ends: 57 [2021-11-07 01:08:09,263 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=218, Invalid=1504, Unknown=0, NotChecked=0, Total=1722 [2021-11-07 01:08:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-07 01:08:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2021-11-07 01:08:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-07 01:08:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2021-11-07 01:08:09,270 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 23 [2021-11-07 01:08:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:09,273 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2021-11-07 01:08:09,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-07 01:08:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2021-11-07 01:08:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 01:08:09,277 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:09,278 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:09,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 01:08:09,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-07 01:08:09,499 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-07 01:08:09,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -44004644, now seen corresponding path program 1 times [2021-11-07 01:08:09,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:09,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588692278] [2021-11-07 01:08:09,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:09,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:08:10,061 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:10,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588692278] [2021-11-07 01:08:10,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588692278] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:08:10,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365392999] [2021-11-07 01:08:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:10,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:08:10,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:08:10,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:08:10,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-07 01:08:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:10,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-07 01:08:10,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:08:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:10,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:08:10,807 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:08:10,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2021-11-07 01:08:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:11,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365392999] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:08:11,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2098182174] [2021-11-07 01:08:11,054 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-07 01:08:11,054 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:08:11,055 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:08:11,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:08:11,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 24 [2021-11-07 01:08:11,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574370182] [2021-11-07 01:08:11,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-07 01:08:11,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-07 01:08:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:08:11,059 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 25 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-07 01:08:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:11,970 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2021-11-07 01:08:11,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 01:08:11,971 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 30 [2021-11-07 01:08:11,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:11,971 INFO L225 Difference]: With dead ends: 48 [2021-11-07 01:08:11,971 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 01:08:11,972 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 01:08:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 01:08:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 01:08:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:08:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 01:08:11,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-11-07 01:08:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:11,973 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 01:08:11,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-07 01:08:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 01:08:11,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 01:08:11,975 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-07 01:08:11,975 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-07 01:08:11,975 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-07 01:08:11,976 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-07 01:08:11,976 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:08:11,976 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:08:11,976 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:08:11,976 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:08:11,976 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:08:11,976 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:08:11,977 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATION [2021-11-07 01:08:11,977 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATION [2021-11-07 01:08:11,977 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATION [2021-11-07 01:08:11,977 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATION [2021-11-07 01:08:11,977 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATION [2021-11-07 01:08:11,977 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATION [2021-11-07 01:08:11,978 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATION [2021-11-07 01:08:11,978 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr8REQUIRES_VIOLATION [2021-11-07 01:08:11,978 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr9ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:08:12,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-07 01:08:12,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-07 01:08:12,190 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:12,191 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:08:12,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:08:12 BoogieIcfgContainer [2021-11-07 01:08:12,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:08:12,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:08:12,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:08:12,194 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:08:12,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:40" (3/4) ... [2021-11-07 01:08:12,197 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 01:08:12,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2021-11-07 01:08:12,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-11-07 01:08:12,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-11-07 01:08:12,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-07 01:08:12,210 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:08:12,255 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:08:12,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:08:12,257 INFO L168 Benchmark]: Toolchain (without parser) took 33035.69 ms. Allocated memory was 102.8 MB in the beginning and 167.8 MB in the end (delta: 65.0 MB). Free memory was 69.4 MB in the beginning and 115.2 MB in the end (delta: -45.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:12,257 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 102.8 MB. Free memory is still 56.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:08:12,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.23 ms. Allocated memory is still 102.8 MB. Free memory was 69.2 MB in the beginning and 76.5 MB in the end (delta: -7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:12,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.65 ms. Allocated memory is still 102.8 MB. Free memory was 76.5 MB in the beginning and 74.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:12,259 INFO L168 Benchmark]: Boogie Preprocessor took 30.55 ms. Allocated memory is still 102.8 MB. Free memory was 74.6 MB in the beginning and 73.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:08:12,259 INFO L168 Benchmark]: RCFGBuilder took 731.17 ms. Allocated memory is still 102.8 MB. Free memory was 73.4 MB in the beginning and 52.9 MB in the end (delta: 20.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:12,260 INFO L168 Benchmark]: TraceAbstraction took 31846.54 ms. Allocated memory was 102.8 MB in the beginning and 167.8 MB in the end (delta: 65.0 MB). Free memory was 52.3 MB in the beginning and 118.4 MB in the end (delta: -66.1 MB). Peak memory consumption was 528.4 kB. Max. memory is 16.1 GB. [2021-11-07 01:08:12,260 INFO L168 Benchmark]: Witness Printer took 61.82 ms. Allocated memory is still 167.8 MB. Free memory was 118.4 MB in the beginning and 115.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:12,263 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.22 ms. Allocated memory is still 102.8 MB. Free memory is still 56.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 297.23 ms. Allocated memory is still 102.8 MB. Free memory was 69.2 MB in the beginning and 76.5 MB in the end (delta: -7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.65 ms. Allocated memory is still 102.8 MB. Free memory was 76.5 MB in the beginning and 74.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.55 ms. Allocated memory is still 102.8 MB. Free memory was 74.6 MB in the beginning and 73.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 731.17 ms. Allocated memory is still 102.8 MB. Free memory was 73.4 MB in the beginning and 52.9 MB in the end (delta: 20.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 31846.54 ms. Allocated memory was 102.8 MB in the beginning and 167.8 MB in the end (delta: 65.0 MB). Free memory was 52.3 MB in the beginning and 118.4 MB in the end (delta: -66.1 MB). Peak memory consumption was 528.4 kB. Max. memory is 16.1 GB. * Witness Printer took 61.82 ms. Allocated memory is still 167.8 MB. Free memory was 118.4 MB in the beginning and 115.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 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 - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 49]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 49]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 31.7s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 1655 SDslu, 1300 SDs, 0 SdLazy, 2596 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 242 SyntacticMatches, 11 SemanticMatches, 311 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=14, InterpolantAutomatonStates: 177, 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, 18 MinimizatonAttempts, 96 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 544 ConstructedInterpolants, 56 QuantifiedInterpolants, 8111 SizeOfPredicates, 123 NumberOfNonLiveVariables, 1573 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 36 InterpolantComputations, 9 PerfectInterpolantSequences, 53/153 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-11-07 01:08:12,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68595062-2953-40d0-8982-d2d1cf3d06c3/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 Result: TRUE