./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan --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 e7731899c5e817fc6eaadbde2ec1f0ed993fe63c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan --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 e7731899c5e817fc6eaadbde2ec1f0ed993fe63c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 02:37:27,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:37:27,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:37:27,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:37:27,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:37:27,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:37:27,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:37:27,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:37:27,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:37:27,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:37:27,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:37:27,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:37:27,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:37:27,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:37:27,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:37:27,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:37:27,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:37:27,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:37:27,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:37:27,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:37:27,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:37:27,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:37:27,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:37:27,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:37:27,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:37:27,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:37:27,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:37:27,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:37:27,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:37:27,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:37:27,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:37:27,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:37:27,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:37:27,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:37:27,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:37:27,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:37:27,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:37:27,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:37:27,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:37:27,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:37:27,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:37:27,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-11-30 02:37:27,461 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:37:27,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:37:27,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:37:27,463 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:37:27,463 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:37:27,464 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:37:27,464 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:37:27,464 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:37:27,465 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:37:27,465 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:37:27,465 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:37:27,466 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:37:27,466 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:37:27,466 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:37:27,467 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:37:27,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 02:37:27,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 02:37:27,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:37:27,468 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:37:27,469 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 02:37:27,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:37:27,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:37:27,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:37:27,470 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 02:37:27,470 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 02:37:27,471 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 02:37:27,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:37:27,471 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:37:27,472 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:37:27,472 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:37:27,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:37:27,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:37:27,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:37:27,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:37:27,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:37:27,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:37:27,474 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:37:27,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:37:27,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:37:27,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:37:27,475 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-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/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-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan 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 -> e7731899c5e817fc6eaadbde2ec1f0ed993fe63c [2020-11-30 02:37:27,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:37:27,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:37:27,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:37:27,883 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:37:27,884 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:37:27,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-queue-1.i [2020-11-30 02:37:27,976 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data/4c75d0f05/f31833adefaf4cd389b80b0a3157ae24/FLAG1d4a10770 [2020-11-30 02:37:28,701 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:37:28,705 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/sv-benchmarks/c/forester-heap/sll-queue-1.i [2020-11-30 02:37:28,736 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data/4c75d0f05/f31833adefaf4cd389b80b0a3157ae24/FLAG1d4a10770 [2020-11-30 02:37:28,948 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data/4c75d0f05/f31833adefaf4cd389b80b0a3157ae24 [2020-11-30 02:37:28,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:37:28,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:37:28,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:37:28,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:37:28,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:37:28,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:37:28" (1/1) ... [2020-11-30 02:37:28,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ba58b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:28, skipping insertion in model container [2020-11-30 02:37:28,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:37:28" (1/1) ... [2020-11-30 02:37:28,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:37:29,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:37:29,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:37:29,527 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:37:29,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:37:29,671 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:37:29,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29 WrapperNode [2020-11-30 02:37:29,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:37:29,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:37:29,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:37:29,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:37:29,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... [2020-11-30 02:37:29,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... [2020-11-30 02:37:29,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:37:29,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:37:29,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:37:29,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:37:29,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... [2020-11-30 02:37:29,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... [2020-11-30 02:37:29,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... [2020-11-30 02:37:29,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... [2020-11-30 02:37:29,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... [2020-11-30 02:37:29,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... [2020-11-30 02:37:29,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... [2020-11-30 02:37:29,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:37:29,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:37:29,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:37:29,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:37:29,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:37:29,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 02:37:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 02:37:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 02:37:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 02:37:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:37:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 02:37:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 02:37:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:37:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:37:29,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:37:31,111 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:37:31,112 INFO L298 CfgBuilder]: Removed 63 assume(true) statements. [2020-11-30 02:37:31,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:37:31 BoogieIcfgContainer [2020-11-30 02:37:31,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:37:31,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:37:31,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:37:31,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:37:31,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:37:28" (1/3) ... [2020-11-30 02:37:31,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aefd10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:37:31, skipping insertion in model container [2020-11-30 02:37:31,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:29" (2/3) ... [2020-11-30 02:37:31,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aefd10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:37:31, skipping insertion in model container [2020-11-30 02:37:31,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:37:31" (3/3) ... [2020-11-30 02:37:31,130 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2020-11-30 02:37:31,144 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:37:31,148 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 70 error locations. [2020-11-30 02:37:31,162 INFO L253 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2020-11-30 02:37:31,188 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:37:31,189 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 02:37:31,189 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:37:31,189 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:37:31,189 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:37:31,189 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:37:31,189 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:37:31,190 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:37:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2020-11-30 02:37:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2020-11-30 02:37:31,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:31,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1] [2020-11-30 02:37:31,226 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:31,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:31,233 INFO L82 PathProgramCache]: Analyzing trace with hash 17302, now seen corresponding path program 1 times [2020-11-30 02:37:31,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:31,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074982557] [2020-11-30 02:37:31,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:31,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074982557] [2020-11-30 02:37:31,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:31,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 02:37:31,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541038066] [2020-11-30 02:37:31,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:37:31,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:31,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:37:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:37:31,460 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 3 states. [2020-11-30 02:37:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:31,697 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2020-11-30 02:37:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:37:31,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2020-11-30 02:37:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:31,715 INFO L225 Difference]: With dead ends: 167 [2020-11-30 02:37:31,715 INFO L226 Difference]: Without dead ends: 165 [2020-11-30 02:37:31,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:37:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-30 02:37:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2020-11-30 02:37:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-30 02:37:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2020-11-30 02:37:31,793 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 2 [2020-11-30 02:37:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:31,793 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2020-11-30 02:37:31,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:37:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2020-11-30 02:37:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2020-11-30 02:37:31,794 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:31,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1] [2020-11-30 02:37:31,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:37:31,796 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash 17303, now seen corresponding path program 1 times [2020-11-30 02:37:31,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:31,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192757090] [2020-11-30 02:37:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:31,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192757090] [2020-11-30 02:37:31,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:31,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 02:37:31,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396183261] [2020-11-30 02:37:31,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:37:31,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:31,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:37:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:37:31,909 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 3 states. [2020-11-30 02:37:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:32,142 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2020-11-30 02:37:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:37:32,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2020-11-30 02:37:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:32,145 INFO L225 Difference]: With dead ends: 154 [2020-11-30 02:37:32,145 INFO L226 Difference]: Without dead ends: 154 [2020-11-30 02:37:32,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:37:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-11-30 02:37:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2020-11-30 02:37:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-11-30 02:37:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2020-11-30 02:37:32,177 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 2 [2020-11-30 02:37:32,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:32,178 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2020-11-30 02:37:32,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:37:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2020-11-30 02:37:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 02:37:32,179 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:32,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 02:37:32,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:37:32,182 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:32,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:32,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1186169487, now seen corresponding path program 1 times [2020-11-30 02:37:32,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:32,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813927796] [2020-11-30 02:37:32,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:32,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813927796] [2020-11-30 02:37:32,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:32,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:37:32,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045063060] [2020-11-30 02:37:32,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:37:32,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:37:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:37:32,324 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 4 states. [2020-11-30 02:37:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:32,548 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2020-11-30 02:37:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:37:32,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-30 02:37:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:32,551 INFO L225 Difference]: With dead ends: 161 [2020-11-30 02:37:32,551 INFO L226 Difference]: Without dead ends: 161 [2020-11-30 02:37:32,552 INFO L677 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 [2020-11-30 02:37:32,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-30 02:37:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2020-11-30 02:37:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-11-30 02:37:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2020-11-30 02:37:32,576 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 6 [2020-11-30 02:37:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:32,576 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2020-11-30 02:37:32,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:37:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2020-11-30 02:37:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 02:37:32,578 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:32,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 02:37:32,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 02:37:32,580 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:32,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:32,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1186169486, now seen corresponding path program 1 times [2020-11-30 02:37:32,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:32,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449302255] [2020-11-30 02:37:32,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:32,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449302255] [2020-11-30 02:37:32,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:32,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:37:32,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750978775] [2020-11-30 02:37:32,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:37:32,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:32,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:37:32,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:37:32,724 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand 6 states. [2020-11-30 02:37:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:33,257 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2020-11-30 02:37:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:37:33,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-11-30 02:37:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:33,260 INFO L225 Difference]: With dead ends: 250 [2020-11-30 02:37:33,261 INFO L226 Difference]: Without dead ends: 250 [2020-11-30 02:37:33,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:37:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-11-30 02:37:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 157. [2020-11-30 02:37:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-30 02:37:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2020-11-30 02:37:33,274 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 6 [2020-11-30 02:37:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:33,275 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2020-11-30 02:37:33,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:37:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2020-11-30 02:37:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 02:37:33,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:33,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:33,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 02:37:33,281 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1742510960, now seen corresponding path program 1 times [2020-11-30 02:37:33,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:33,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9222021] [2020-11-30 02:37:33,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:33,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9222021] [2020-11-30 02:37:33,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:33,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:37:33,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676538888] [2020-11-30 02:37:33,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:37:33,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:33,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:37:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:37:33,375 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand 3 states. [2020-11-30 02:37:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:33,447 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2020-11-30 02:37:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:37:33,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-11-30 02:37:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:33,449 INFO L225 Difference]: With dead ends: 142 [2020-11-30 02:37:33,449 INFO L226 Difference]: Without dead ends: 142 [2020-11-30 02:37:33,449 INFO L677 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 [2020-11-30 02:37:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-30 02:37:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-11-30 02:37:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-30 02:37:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2020-11-30 02:37:33,467 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 8 [2020-11-30 02:37:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:33,468 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2020-11-30 02:37:33,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:37:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2020-11-30 02:37:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 02:37:33,469 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:33,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:33,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 02:37:33,470 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:33,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1742528070, now seen corresponding path program 1 times [2020-11-30 02:37:33,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:33,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295550682] [2020-11-30 02:37:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:33,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295550682] [2020-11-30 02:37:33,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:33,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:37:33,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447501106] [2020-11-30 02:37:33,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:37:33,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:33,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:37:33,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:37:33,561 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand 5 states. [2020-11-30 02:37:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:34,007 INFO L93 Difference]: Finished difference Result 248 states and 264 transitions. [2020-11-30 02:37:34,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:37:34,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-30 02:37:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:34,010 INFO L225 Difference]: With dead ends: 248 [2020-11-30 02:37:34,010 INFO L226 Difference]: Without dead ends: 248 [2020-11-30 02:37:34,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:37:34,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-11-30 02:37:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 141. [2020-11-30 02:37:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-11-30 02:37:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2020-11-30 02:37:34,019 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 8 [2020-11-30 02:37:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:34,019 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2020-11-30 02:37:34,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:37:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2020-11-30 02:37:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 02:37:34,020 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:34,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:34,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 02:37:34,021 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1742528069, now seen corresponding path program 1 times [2020-11-30 02:37:34,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:34,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138734920] [2020-11-30 02:37:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:34,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138734920] [2020-11-30 02:37:34,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:34,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:37:34,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084821800] [2020-11-30 02:37:34,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:37:34,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:37:34,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:37:34,110 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand 5 states. [2020-11-30 02:37:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:34,550 INFO L93 Difference]: Finished difference Result 245 states and 266 transitions. [2020-11-30 02:37:34,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:37:34,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-30 02:37:34,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:34,553 INFO L225 Difference]: With dead ends: 245 [2020-11-30 02:37:34,553 INFO L226 Difference]: Without dead ends: 245 [2020-11-30 02:37:34,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:37:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-11-30 02:37:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 131. [2020-11-30 02:37:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-11-30 02:37:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2020-11-30 02:37:34,559 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 8 [2020-11-30 02:37:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:34,559 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2020-11-30 02:37:34,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:37:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2020-11-30 02:37:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 02:37:34,562 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:34,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:34,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 02:37:34,563 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash 720209963, now seen corresponding path program 1 times [2020-11-30 02:37:34,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:34,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954947513] [2020-11-30 02:37:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:34,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954947513] [2020-11-30 02:37:34,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:34,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:37:34,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586464178] [2020-11-30 02:37:34,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:37:34,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:37:34,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:37:34,623 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 3 states. [2020-11-30 02:37:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:34,684 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2020-11-30 02:37:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:37:34,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-30 02:37:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:34,686 INFO L225 Difference]: With dead ends: 178 [2020-11-30 02:37:34,686 INFO L226 Difference]: Without dead ends: 178 [2020-11-30 02:37:34,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:37:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-11-30 02:37:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 142. [2020-11-30 02:37:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-30 02:37:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2020-11-30 02:37:34,691 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 14 [2020-11-30 02:37:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:34,691 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2020-11-30 02:37:34,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:37:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2020-11-30 02:37:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 02:37:34,693 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:34,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:34,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 02:37:34,693 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:34,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:34,694 INFO L82 PathProgramCache]: Analyzing trace with hash -838014809, now seen corresponding path program 1 times [2020-11-30 02:37:34,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:34,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326512629] [2020-11-30 02:37:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:34,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326512629] [2020-11-30 02:37:34,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:34,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:37:34,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352071345] [2020-11-30 02:37:34,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:37:34,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:34,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:37:34,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:37:34,754 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand 5 states. [2020-11-30 02:37:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:34,957 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2020-11-30 02:37:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:37:34,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-30 02:37:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:34,981 INFO L225 Difference]: With dead ends: 175 [2020-11-30 02:37:34,982 INFO L226 Difference]: Without dead ends: 175 [2020-11-30 02:37:34,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:37:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-11-30 02:37:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 139. [2020-11-30 02:37:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-11-30 02:37:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2020-11-30 02:37:34,987 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 15 [2020-11-30 02:37:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:34,988 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2020-11-30 02:37:34,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:37:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2020-11-30 02:37:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 02:37:34,989 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:34,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:34,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 02:37:34,989 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:34,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash 364760680, now seen corresponding path program 1 times [2020-11-30 02:37:34,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:34,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320205332] [2020-11-30 02:37:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:35,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320205332] [2020-11-30 02:37:35,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:35,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:37:35,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402263553] [2020-11-30 02:37:35,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:37:35,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:35,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:37:35,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:37:35,083 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand 5 states. [2020-11-30 02:37:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:35,243 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2020-11-30 02:37:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:37:35,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-30 02:37:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:35,245 INFO L225 Difference]: With dead ends: 144 [2020-11-30 02:37:35,245 INFO L226 Difference]: Without dead ends: 144 [2020-11-30 02:37:35,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:37:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-30 02:37:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2020-11-30 02:37:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-30 02:37:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2020-11-30 02:37:35,251 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 16 [2020-11-30 02:37:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:35,251 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2020-11-30 02:37:35,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:37:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2020-11-30 02:37:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 02:37:35,252 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:35,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:35,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 02:37:35,253 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:35,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1577704230, now seen corresponding path program 1 times [2020-11-30 02:37:35,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:35,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080806063] [2020-11-30 02:37:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:35,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080806063] [2020-11-30 02:37:35,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:37:35,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:37:35,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260586908] [2020-11-30 02:37:35,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:37:35,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:35,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:37:35,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:37:35,300 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand 4 states. [2020-11-30 02:37:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:35,423 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2020-11-30 02:37:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:37:35,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-30 02:37:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:35,424 INFO L225 Difference]: With dead ends: 142 [2020-11-30 02:37:35,425 INFO L226 Difference]: Without dead ends: 142 [2020-11-30 02:37:35,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:37:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-30 02:37:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-11-30 02:37:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-30 02:37:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2020-11-30 02:37:35,434 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 17 [2020-11-30 02:37:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:35,434 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2020-11-30 02:37:35,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:37:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2020-11-30 02:37:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 02:37:35,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:35,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:35,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 02:37:35,436 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1559052966, now seen corresponding path program 1 times [2020-11-30 02:37:35,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:35,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437854723] [2020-11-30 02:37:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:35,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437854723] [2020-11-30 02:37:35,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345469201] [2020-11-30 02:37:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:37:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:35,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 02:37:35,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:37:36,218 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-11-30 02:37:36,243 INFO L350 Elim1Store]: treesize reduction 129, result has 40.6 percent of original size [2020-11-30 02:37:36,243 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 127 [2020-11-30 02:37:36,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 4, 1] term [2020-11-30 02:37:36,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:37:36,256 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:37:36,460 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2020-11-30 02:37:36,461 INFO L625 ElimStorePlain]: treesize reduction 66, result has 48.0 percent of original size [2020-11-30 02:37:36,466 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-11-30 02:37:36,477 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 02:37:36,484 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 02:37:36,484 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:61 [2020-11-30 02:37:36,491 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-11-30 02:37:36,493 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 02:37:36,557 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-11-30 02:37:36,568 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 02:37:36,748 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2020-11-30 02:37:37,286 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 02:37:37,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:37:37,327 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2020-11-30 02:37:37,329 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:37:37,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:37:37,346 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2020-11-30 02:37:37,348 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:37:37,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:37:37,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:37:37,390 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:37:37,390 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 47 [2020-11-30 02:37:37,392 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 02:37:37,526 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-30 02:37:37,527 INFO L625 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2020-11-30 02:37:37,531 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2020-11-30 02:37:37,531 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:78 [2020-11-30 02:37:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:37,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:37:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:37,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929727094] [2020-11-30 02:37:37,732 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-11-30 02:37:37,732 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:37:37,738 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:37:37,746 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:37:37,747 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:37:38,291 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:37:38,349 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:37:38,622 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:37:38,796 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2020-11-30 02:37:39,068 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-11-30 02:37:39,399 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-11-30 02:37:39,820 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2020-11-30 02:37:40,204 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2020-11-30 02:37:40,966 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2020-11-30 02:37:41,384 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 85 [2020-11-30 02:37:41,856 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2020-11-30 02:37:42,116 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 02:37:42,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:37:42,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2020-11-30 02:37:42,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266392524] [2020-11-30 02:37:42,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 02:37:42,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:42,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 02:37:42,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2020-11-30 02:37:42,118 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 10 states. [2020-11-30 02:37:42,453 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-11-30 02:37:42,624 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-11-30 02:37:42,870 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2020-11-30 02:37:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:43,456 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2020-11-30 02:37:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:37:43,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-11-30 02:37:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:43,458 INFO L225 Difference]: With dead ends: 169 [2020-11-30 02:37:43,458 INFO L226 Difference]: Without dead ends: 167 [2020-11-30 02:37:43,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 21 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2020-11-30 02:37:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-11-30 02:37:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2020-11-30 02:37:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-11-30 02:37:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2020-11-30 02:37:43,465 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 20 [2020-11-30 02:37:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:43,465 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2020-11-30 02:37:43,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 02:37:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2020-11-30 02:37:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 02:37:43,466 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:43,466 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:43,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-11-30 02:37:43,689 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:43,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1559053941, now seen corresponding path program 1 times [2020-11-30 02:37:43,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:43,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368127525] [2020-11-30 02:37:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:43,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368127525] [2020-11-30 02:37:43,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026189749] [2020-11-30 02:37:43,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:37:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:43,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:37:43,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:37:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:44,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:37:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:44,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601820474] [2020-11-30 02:37:44,112 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2020-11-30 02:37:44,113 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:37:44,113 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:37:44,113 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:37:44,114 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:37:44,556 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:37:44,655 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:37:44,733 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:37:44,948 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-11-30 02:37:45,174 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-11-30 02:37:45,438 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2020-11-30 02:37:45,748 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2020-11-30 02:37:46,360 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2020-11-30 02:37:46,743 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 85 [2020-11-30 02:37:47,134 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 80 [2020-11-30 02:37:47,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:37:47,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 12 [2020-11-30 02:37:47,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684996034] [2020-11-30 02:37:47,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 02:37:47,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:47,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 02:37:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:37:47,312 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 10 states. [2020-11-30 02:37:47,683 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-11-30 02:37:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:48,165 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2020-11-30 02:37:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 02:37:48,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-11-30 02:37:48,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:48,167 INFO L225 Difference]: With dead ends: 156 [2020-11-30 02:37:48,167 INFO L226 Difference]: Without dead ends: 156 [2020-11-30 02:37:48,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:37:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-11-30 02:37:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2020-11-30 02:37:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-11-30 02:37:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2020-11-30 02:37:48,173 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 20 [2020-11-30 02:37:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:48,173 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2020-11-30 02:37:48,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 02:37:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2020-11-30 02:37:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 02:37:48,175 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:48,175 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:48,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-11-30 02:37:48,376 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1428942484, now seen corresponding path program 2 times [2020-11-30 02:37:48,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:48,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876615975] [2020-11-30 02:37:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:48,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876615975] [2020-11-30 02:37:48,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739513716] [2020-11-30 02:37:48,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:37:48,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-30 02:37:48,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 02:37:48,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 02:37:48,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:37:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:48,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:37:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:37:48,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [166337647] [2020-11-30 02:37:48,871 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-11-30 02:37:48,871 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 02:37:48,871 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 02:37:48,872 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 02:37:48,872 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 02:37:49,229 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:37:49,279 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 02:37:49,411 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 02:37:49,555 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2020-11-30 02:37:49,782 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-11-30 02:37:49,993 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-11-30 02:37:50,330 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2020-11-30 02:37:50,658 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2020-11-30 02:37:51,184 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2020-11-30 02:37:51,553 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 85 [2020-11-30 02:37:52,021 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 80 [2020-11-30 02:37:52,455 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 02:37:52,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 02:37:52,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2020-11-30 02:37:52,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423070763] [2020-11-30 02:37:52,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 02:37:52,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:37:52,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 02:37:52,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2020-11-30 02:37:52,457 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand 11 states. [2020-11-30 02:37:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:37:52,754 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2020-11-30 02:37:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:37:52,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-11-30 02:37:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:37:52,756 INFO L225 Difference]: With dead ends: 149 [2020-11-30 02:37:52,756 INFO L226 Difference]: Without dead ends: 135 [2020-11-30 02:37:52,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2020-11-30 02:37:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-30 02:37:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-11-30 02:37:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-30 02:37:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2020-11-30 02:37:52,761 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 25 [2020-11-30 02:37:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:37:52,761 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2020-11-30 02:37:52,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 02:37:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2020-11-30 02:37:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 02:37:52,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:37:52,763 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:37:52,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2020-11-30 02:37:52,988 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:37:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:37:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash 761812598, now seen corresponding path program 1 times [2020-11-30 02:37:52,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:37:52,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734774210] [2020-11-30 02:37:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:37:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:37:53,056 ERROR L253 erpolLogProxyWrapper]: Interpolant 6 not inductive [2020-11-30 02:37:53,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-11-30 02:37:53,070 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:197) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:231) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-11-30 02:37:53,075 INFO L168 Benchmark]: Toolchain (without parser) took 24121.81 ms. Allocated memory was 104.9 MB in the beginning and 293.6 MB in the end (delta: 188.7 MB). Free memory was 75.9 MB in the beginning and 174.7 MB in the end (delta: -98.8 MB). Peak memory consumption was 89.6 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:53,076 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 104.9 MB. Free memory is still 60.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:37:53,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.77 ms. Allocated memory is still 104.9 MB. Free memory was 75.6 MB in the beginning and 68.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:53,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.36 ms. Allocated memory is still 104.9 MB. Free memory was 68.8 MB in the beginning and 66.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:53,078 INFO L168 Benchmark]: Boogie Preprocessor took 48.54 ms. Allocated memory is still 104.9 MB. Free memory was 66.4 MB in the beginning and 63.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:53,079 INFO L168 Benchmark]: RCFGBuilder took 1319.87 ms. Allocated memory was 104.9 MB in the beginning and 134.2 MB in the end (delta: 29.4 MB). Free memory was 63.9 MB in the beginning and 106.5 MB in the end (delta: -42.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:53,080 INFO L168 Benchmark]: TraceAbstraction took 21957.31 ms. Allocated memory was 134.2 MB in the beginning and 293.6 MB in the end (delta: 159.4 MB). Free memory was 105.7 MB in the beginning and 174.7 MB in the end (delta: -69.0 MB). Peak memory consumption was 91.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:37:53,083 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.33 ms. Allocated memory is still 104.9 MB. Free memory is still 60.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 712.77 ms. Allocated memory is still 104.9 MB. Free memory was 75.6 MB in the beginning and 68.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.36 ms. Allocated memory is still 104.9 MB. Free memory was 68.8 MB in the beginning and 66.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.54 ms. Allocated memory is still 104.9 MB. Free memory was 66.4 MB in the beginning and 63.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1319.87 ms. Allocated memory was 104.9 MB in the beginning and 134.2 MB in the end (delta: 29.4 MB). Free memory was 63.9 MB in the beginning and 106.5 MB in the end (delta: -42.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21957.31 ms. Allocated memory was 134.2 MB in the beginning and 293.6 MB in the end (delta: 159.4 MB). Free memory was 105.7 MB in the beginning and 174.7 MB in the end (delta: -69.0 MB). Peak memory consumption was 91.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 02:37:56,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:37:56,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:37:56,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:37:56,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:37:56,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:37:56,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:37:56,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:37:56,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:37:56,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:37:56,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:37:56,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:37:56,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:37:56,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:37:56,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:37:56,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:37:56,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:37:56,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:37:56,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:37:56,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:37:56,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:37:56,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:37:56,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:37:56,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:37:56,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:37:56,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:37:56,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:37:56,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:37:56,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:37:56,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:37:56,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:37:56,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:37:56,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:37:56,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:37:56,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:37:56,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:37:56,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:37:56,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:37:56,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:37:56,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:37:56,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:37:56,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-11-30 02:37:56,523 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:37:56,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:37:56,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:37:56,529 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:37:56,529 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:37:56,530 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:37:56,530 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:37:56,531 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:37:56,531 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:37:56,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 02:37:56,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 02:37:56,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:37:56,535 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:37:56,535 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 02:37:56,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:37:56,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:37:56,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:37:56,536 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 02:37:56,536 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 02:37:56,537 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 02:37:56,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:37:56,547 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:37:56,547 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 02:37:56,547 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 02:37:56,548 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:37:56,548 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:37:56,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:37:56,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 02:37:56,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:37:56,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:37:56,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:37:56,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:37:56,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:37:56,551 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-11-30 02:37:56,551 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 02:37:56,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:37:56,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:37:56,552 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/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-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan 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 -> e7731899c5e817fc6eaadbde2ec1f0ed993fe63c [2020-11-30 02:37:57,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:37:57,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:37:57,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:37:57,109 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:37:57,110 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:37:57,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-queue-1.i [2020-11-30 02:37:57,208 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data/eb389eabd/e8cc1f66936843618746aabbb9ad2567/FLAG20cb05501 [2020-11-30 02:37:57,935 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:37:57,936 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/sv-benchmarks/c/forester-heap/sll-queue-1.i [2020-11-30 02:37:57,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data/eb389eabd/e8cc1f66936843618746aabbb9ad2567/FLAG20cb05501 [2020-11-30 02:37:58,243 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/data/eb389eabd/e8cc1f66936843618746aabbb9ad2567 [2020-11-30 02:37:58,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:37:58,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:37:58,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:37:58,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:37:58,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:37:58,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:58,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a31e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58, skipping insertion in model container [2020-11-30 02:37:58,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:58,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:37:58,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:37:58,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:37:58,822 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:37:58,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:37:58,989 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:37:58,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58 WrapperNode [2020-11-30 02:37:58,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:37:58,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:37:58,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:37:58,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:37:59,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:59,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:59,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:37:59,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:37:59,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:37:59,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:37:59,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:59,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:59,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:59,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:59,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:59,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:59,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... [2020-11-30 02:37:59,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:37:59,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:37:59,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:37:59,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:37:59,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:37:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-30 02:37:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 02:37:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 02:37:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:37:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 02:37:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 02:37:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 02:37:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 02:37:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:37:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:38:00,712 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:38:00,713 INFO L298 CfgBuilder]: Removed 63 assume(true) statements. [2020-11-30 02:38:00,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:38:00 BoogieIcfgContainer [2020-11-30 02:38:00,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:38:00,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:38:00,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:38:00,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:38:00,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:37:58" (1/3) ... [2020-11-30 02:38:00,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e7e6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:38:00, skipping insertion in model container [2020-11-30 02:38:00,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:37:58" (2/3) ... [2020-11-30 02:38:00,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e7e6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:38:00, skipping insertion in model container [2020-11-30 02:38:00,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:38:00" (3/3) ... [2020-11-30 02:38:00,731 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2020-11-30 02:38:00,745 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:38:00,752 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 70 error locations. [2020-11-30 02:38:00,769 INFO L253 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2020-11-30 02:38:00,798 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:38:00,798 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 02:38:00,799 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:38:00,799 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:38:00,799 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:38:00,799 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:38:00,800 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:38:00,800 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:38:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states. [2020-11-30 02:38:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-30 02:38:00,835 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:00,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-30 02:38:00,837 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:00,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:00,845 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2020-11-30 02:38:00,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:00,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769954456] [2020-11-30 02:38:00,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:00,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:00,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:01,068 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:38:01,069 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:01,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:01,079 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:01,079 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:38:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:01,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:01,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769954456] [2020-11-30 02:38:01,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:01,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 02:38:01,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983646100] [2020-11-30 02:38:01,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:01,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:01,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:01,134 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 3 states. [2020-11-30 02:38:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:01,648 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2020-11-30 02:38:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:01,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-30 02:38:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:01,670 INFO L225 Difference]: With dead ends: 179 [2020-11-30 02:38:01,671 INFO L226 Difference]: Without dead ends: 175 [2020-11-30 02:38:01,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-11-30 02:38:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-11-30 02:38:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-11-30 02:38:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2020-11-30 02:38:01,757 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2020-11-30 02:38:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:01,757 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2020-11-30 02:38:01,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2020-11-30 02:38:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-30 02:38:01,759 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:01,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-30 02:38:01,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 02:38:01,985 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:01,987 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-11-30 02:38:01,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:01,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46297410] [2020-11-30 02:38:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:02,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:02,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:02,087 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:38:02,087 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:02,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:02,097 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:02,097 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 02:38:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:02,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:02,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46297410] [2020-11-30 02:38:02,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:02,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-11-30 02:38:02,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672108900] [2020-11-30 02:38:02,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:38:02,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:02,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:38:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:02,192 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand 4 states. [2020-11-30 02:38:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:02,695 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2020-11-30 02:38:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:38:02,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-11-30 02:38:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:02,699 INFO L225 Difference]: With dead ends: 165 [2020-11-30 02:38:02,699 INFO L226 Difference]: Without dead ends: 165 [2020-11-30 02:38:02,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-30 02:38:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2020-11-30 02:38:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-11-30 02:38:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2020-11-30 02:38:02,714 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 3 [2020-11-30 02:38:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:02,714 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2020-11-30 02:38:02,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:38:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2020-11-30 02:38:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 02:38:02,715 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:02,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:02,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 02:38:02,935 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2020-11-30 02:38:02,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:02,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185562809] [2020-11-30 02:38:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:03,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:03,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:03,078 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:38:03,079 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:03,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:03,088 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:03,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:38:03,322 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:03,323 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2020-11-30 02:38:03,326 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:03,372 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-30 02:38:03,374 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:03,374 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-11-30 02:38:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:03,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:03,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185562809] [2020-11-30 02:38:03,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:03,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:03,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869752861] [2020-11-30 02:38:03,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:38:03,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:03,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:38:03,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:03,453 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 4 states. [2020-11-30 02:38:03,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:03,990 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2020-11-30 02:38:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:38:03,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-30 02:38:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:03,993 INFO L225 Difference]: With dead ends: 172 [2020-11-30 02:38:03,993 INFO L226 Difference]: Without dead ends: 172 [2020-11-30 02:38:03,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:38:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-11-30 02:38:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2020-11-30 02:38:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-11-30 02:38:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2020-11-30 02:38:04,007 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 7 [2020-11-30 02:38:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:04,007 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2020-11-30 02:38:04,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:38:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2020-11-30 02:38:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 02:38:04,008 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:04,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:04,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 02:38:04,223 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:04,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2020-11-30 02:38:04,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:04,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978335273] [2020-11-30 02:38:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:04,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:38:04,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:04,358 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:38:04,359 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:04,368 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:04,369 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:04,369 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 02:38:04,445 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:04,446 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2020-11-30 02:38:04,447 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:04,484 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-30 02:38:04,486 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:04,486 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2020-11-30 02:38:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:04,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:04,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978335273] [2020-11-30 02:38:04,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:04,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2020-11-30 02:38:04,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428195342] [2020-11-30 02:38:04,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:38:04,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:04,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:38:04,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:38:04,885 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand 7 states. [2020-11-30 02:38:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:06,419 INFO L93 Difference]: Finished difference Result 262 states and 277 transitions. [2020-11-30 02:38:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:38:06,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2020-11-30 02:38:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:06,422 INFO L225 Difference]: With dead ends: 262 [2020-11-30 02:38:06,422 INFO L226 Difference]: Without dead ends: 262 [2020-11-30 02:38:06,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:38:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-30 02:38:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 164. [2020-11-30 02:38:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-30 02:38:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2020-11-30 02:38:06,435 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 7 [2020-11-30 02:38:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:06,436 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2020-11-30 02:38:06,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:38:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2020-11-30 02:38:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 02:38:06,437 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:06,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:06,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 02:38:06,652 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:06,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1837325540, now seen corresponding path program 1 times [2020-11-30 02:38:06,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:06,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635899893] [2020-11-30 02:38:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:06,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:06,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:06,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:06,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635899893] [2020-11-30 02:38:06,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:06,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:38:06,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570439252] [2020-11-30 02:38:06,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:38:06,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:06,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:38:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:06,767 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand 3 states. [2020-11-30 02:38:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:06,898 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2020-11-30 02:38:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:38:06,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 02:38:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:06,901 INFO L225 Difference]: With dead ends: 149 [2020-11-30 02:38:06,901 INFO L226 Difference]: Without dead ends: 149 [2020-11-30 02:38:06,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:38:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-11-30 02:38:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2020-11-30 02:38:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-11-30 02:38:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2020-11-30 02:38:06,910 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 9 [2020-11-30 02:38:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:06,911 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2020-11-30 02:38:06,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:38:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2020-11-30 02:38:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:38:06,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:06,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:07,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 02:38:07,137 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:07,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1121499220, now seen corresponding path program 1 times [2020-11-30 02:38:07,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:07,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114438526] [2020-11-30 02:38:07,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:07,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:07,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:07,297 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:38:07,297 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:07,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:07,301 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:07,302 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:38:07,330 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:07,330 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:07,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:07,343 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:07,343 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 02:38:07,370 INFO L384 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 17 treesize of output 9 [2020-11-30 02:38:07,371 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:07,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:07,375 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:07,375 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-11-30 02:38:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:07,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:07,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114438526] [2020-11-30 02:38:07,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:07,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 02:38:07,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779832161] [2020-11-30 02:38:07,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:07,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:07,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:07,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:07,421 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand 6 states. [2020-11-30 02:38:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:08,284 INFO L93 Difference]: Finished difference Result 258 states and 274 transitions. [2020-11-30 02:38:08,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:38:08,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 02:38:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:08,288 INFO L225 Difference]: With dead ends: 258 [2020-11-30 02:38:08,288 INFO L226 Difference]: Without dead ends: 258 [2020-11-30 02:38:08,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:38:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-11-30 02:38:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 148. [2020-11-30 02:38:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-30 02:38:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2020-11-30 02:38:08,304 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 10 [2020-11-30 02:38:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:08,305 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2020-11-30 02:38:08,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2020-11-30 02:38:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:38:08,306 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:08,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:08,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 02:38:08,511 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1121499221, now seen corresponding path program 1 times [2020-11-30 02:38:08,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:08,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180711511] [2020-11-30 02:38:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:08,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:38:08,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:08,628 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:38:08,628 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:08,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:08,638 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:08,638 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 02:38:08,659 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:08,660 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:08,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:08,699 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:08,700 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:08,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:08,711 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:08,711 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-11-30 02:38:08,781 INFO L384 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 15 treesize of output 7 [2020-11-30 02:38:08,782 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:08,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:08,805 INFO L384 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 19 treesize of output 11 [2020-11-30 02:38:08,806 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:08,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:08,816 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:08,816 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2020-11-30 02:38:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:08,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:09,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180711511] [2020-11-30 02:38:09,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:09,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-11-30 02:38:09,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704032645] [2020-11-30 02:38:09,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 02:38:09,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:09,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 02:38:09,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:38:09,142 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 10 states. [2020-11-30 02:38:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:11,515 INFO L93 Difference]: Finished difference Result 260 states and 281 transitions. [2020-11-30 02:38:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:38:11,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2020-11-30 02:38:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:11,519 INFO L225 Difference]: With dead ends: 260 [2020-11-30 02:38:11,520 INFO L226 Difference]: Without dead ends: 260 [2020-11-30 02:38:11,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-11-30 02:38:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-11-30 02:38:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 141. [2020-11-30 02:38:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-11-30 02:38:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2020-11-30 02:38:11,527 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 10 [2020-11-30 02:38:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:11,527 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2020-11-30 02:38:11,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 02:38:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2020-11-30 02:38:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 02:38:11,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:11,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:11,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 02:38:11,745 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1606711009, now seen corresponding path program 1 times [2020-11-30 02:38:11,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:11,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867551630] [2020-11-30 02:38:11,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:11,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 02:38:11,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:11,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:11,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867551630] [2020-11-30 02:38:11,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:11,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-30 02:38:11,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781682234] [2020-11-30 02:38:11,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:38:11,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:11,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:38:11,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:11,873 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand 4 states. [2020-11-30 02:38:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:11,945 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2020-11-30 02:38:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:38:11,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-30 02:38:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:11,947 INFO L225 Difference]: With dead ends: 253 [2020-11-30 02:38:11,947 INFO L226 Difference]: Without dead ends: 253 [2020-11-30 02:38:11,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-11-30 02:38:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 166. [2020-11-30 02:38:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-11-30 02:38:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2020-11-30 02:38:11,952 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 15 [2020-11-30 02:38:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:11,953 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2020-11-30 02:38:11,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:38:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2020-11-30 02:38:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 02:38:11,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:11,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:12,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 02:38:12,164 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:12,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash -768894255, now seen corresponding path program 1 times [2020-11-30 02:38:12,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:12,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111474142] [2020-11-30 02:38:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:12,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 02:38:12,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:12,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:12,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111474142] [2020-11-30 02:38:12,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:12,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 02:38:12,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179720206] [2020-11-30 02:38:12,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:38:12,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:12,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:38:12,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:38:12,304 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand 4 states. [2020-11-30 02:38:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:12,374 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2020-11-30 02:38:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:38:12,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-30 02:38:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:12,377 INFO L225 Difference]: With dead ends: 197 [2020-11-30 02:38:12,377 INFO L226 Difference]: Without dead ends: 197 [2020-11-30 02:38:12,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:38:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-11-30 02:38:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 175. [2020-11-30 02:38:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-11-30 02:38:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 193 transitions. [2020-11-30 02:38:12,389 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 193 transitions. Word has length 17 [2020-11-30 02:38:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:12,391 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 193 transitions. [2020-11-30 02:38:12,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:38:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 193 transitions. [2020-11-30 02:38:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 02:38:12,395 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:12,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:12,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 02:38:12,615 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1649369853, now seen corresponding path program 1 times [2020-11-30 02:38:12,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:12,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193262366] [2020-11-30 02:38:12,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:12,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 02:38:12,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:12,772 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:38:12,773 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:12,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:12,785 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:12,785 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-11-30 02:38:12,806 INFO L384 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 16 treesize of output 8 [2020-11-30 02:38:12,806 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:12,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:12,815 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:12,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-11-30 02:38:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:12,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:12,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193262366] [2020-11-30 02:38:12,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:12,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 02:38:12,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864763735] [2020-11-30 02:38:12,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:38:12,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:12,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:38:12,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:38:12,846 INFO L87 Difference]: Start difference. First operand 175 states and 193 transitions. Second operand 6 states. [2020-11-30 02:38:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:13,289 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2020-11-30 02:38:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:38:13,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-30 02:38:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:13,291 INFO L225 Difference]: With dead ends: 194 [2020-11-30 02:38:13,291 INFO L226 Difference]: Without dead ends: 194 [2020-11-30 02:38:13,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:38:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-11-30 02:38:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 172. [2020-11-30 02:38:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-11-30 02:38:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2020-11-30 02:38:13,297 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 18 [2020-11-30 02:38:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:13,314 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2020-11-30 02:38:13,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:38:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2020-11-30 02:38:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 02:38:13,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:13,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:13,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 02:38:13,530 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash -185517532, now seen corresponding path program 1 times [2020-11-30 02:38:13,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:13,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183233101] [2020-11-30 02:38:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:13,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:38:13,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:13,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:13,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183233101] [2020-11-30 02:38:13,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:13,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2020-11-30 02:38:13,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695321131] [2020-11-30 02:38:13,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:38:13,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:38:13,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:38:13,755 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 7 states. [2020-11-30 02:38:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:14,075 INFO L93 Difference]: Finished difference Result 176 states and 192 transitions. [2020-11-30 02:38:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 02:38:14,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-30 02:38:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:14,078 INFO L225 Difference]: With dead ends: 176 [2020-11-30 02:38:14,078 INFO L226 Difference]: Without dead ends: 176 [2020-11-30 02:38:14,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:38:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-30 02:38:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2020-11-30 02:38:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-11-30 02:38:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 188 transitions. [2020-11-30 02:38:14,084 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 188 transitions. Word has length 19 [2020-11-30 02:38:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:14,085 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 188 transitions. [2020-11-30 02:38:14,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:38:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2020-11-30 02:38:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 02:38:14,086 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:14,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:14,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 02:38:14,287 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:14,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:14,287 INFO L82 PathProgramCache]: Analyzing trace with hash -173032054, now seen corresponding path program 1 times [2020-11-30 02:38:14,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:14,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887436183] [2020-11-30 02:38:14,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:14,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:38:14,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:14,400 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:14,400 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:14,413 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:14,414 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:14,422 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,422 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-11-30 02:38:14,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:38:14,484 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 02:38:14,484 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,503 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:14,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:38:14,510 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 02:38:14,510 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:14,520 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,521 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:15 [2020-11-30 02:38:14,544 INFO L384 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 15 treesize of output 7 [2020-11-30 02:38:14,545 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,556 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:14,575 INFO L384 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 15 treesize of output 7 [2020-11-30 02:38:14,576 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:14,583 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,583 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2020-11-30 02:38:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:14,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:14,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:38:14,656 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,660 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:14,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:14,722 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:14,726 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:14,738 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:14,739 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 02:38:14,740 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2020-11-30 02:38:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:14,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887436183] [2020-11-30 02:38:14,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:38:14,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 02:38:14,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797988472] [2020-11-30 02:38:14,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:38:14,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:14,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:38:14,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:38:14,756 INFO L87 Difference]: Start difference. First operand 172 states and 188 transitions. Second operand 5 states. [2020-11-30 02:38:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:15,203 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2020-11-30 02:38:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:38:15,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-11-30 02:38:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:15,206 INFO L225 Difference]: With dead ends: 169 [2020-11-30 02:38:15,206 INFO L226 Difference]: Without dead ends: 169 [2020-11-30 02:38:15,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:38:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-11-30 02:38:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2020-11-30 02:38:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-11-30 02:38:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2020-11-30 02:38:15,215 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 19 [2020-11-30 02:38:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:15,219 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2020-11-30 02:38:15,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:38:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2020-11-30 02:38:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 02:38:15,222 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:15,222 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:15,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-11-30 02:38:15,437 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash 870648057, now seen corresponding path program 1 times [2020-11-30 02:38:15,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:15,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704463629] [2020-11-30 02:38:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:15,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 02:38:15,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:15,554 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:15,554 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:15,575 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:15,576 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:15,586 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,586 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-11-30 02:38:15,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:38:15,614 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 02:38:15,614 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,642 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:15,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:38:15,651 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 02:38:15,651 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:15,666 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,666 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:15 [2020-11-30 02:38:15,689 INFO L384 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 15 treesize of output 7 [2020-11-30 02:38:15,690 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:15,707 INFO L384 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 15 treesize of output 7 [2020-11-30 02:38:15,708 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:15,715 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,715 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2020-11-30 02:38:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:15,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:15,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:38:15,768 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:15,773 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:15,824 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:15,835 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:15,842 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:15,843 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 02:38:15,844 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2020-11-30 02:38:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:15,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704463629] [2020-11-30 02:38:15,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [78330400] [2020-11-30 02:38:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:16,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 02:38:16,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:16,096 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:16,096 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,112 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,118 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:16,119 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,131 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,131 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-11-30 02:38:16,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:38:16,172 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 02:38:16,173 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,204 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:38:16,209 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 02:38:16,210 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,220 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,220 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2020-11-30 02:38:16,240 INFO L384 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 15 treesize of output 7 [2020-11-30 02:38:16,241 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,258 INFO L384 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 15 treesize of output 7 [2020-11-30 02:38:16,259 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,272 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,272 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-11-30 02:38:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:16,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:16,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:38:16,314 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,320 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:16,368 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,376 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,382 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:16,393 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,395 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 02:38:16,395 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2020-11-30 02:38:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:16,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021285184] [2020-11-30 02:38:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:38:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:16,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 02:38:16,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:16,531 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:16,531 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,551 INFO L384 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 11 treesize of output 7 [2020-11-30 02:38:16,552 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,567 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,568 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-11-30 02:38:16,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:38:16,588 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 02:38:16,589 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 02:38:16,616 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 02:38:16,616 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,624 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,624 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:15 [2020-11-30 02:38:16,683 INFO L384 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 15 treesize of output 7 [2020-11-30 02:38:16,684 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,696 INFO L384 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 15 treesize of output 7 [2020-11-30 02:38:16,697 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,703 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,703 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2020-11-30 02:38:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:16,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:16,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:38:16,770 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:16,779 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,818 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:16,829 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:16,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:16,840 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 02:38:16,840 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2020-11-30 02:38:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:16,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:38:16,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6, 5, 6, 5] total 8 [2020-11-30 02:38:16,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395110312] [2020-11-30 02:38:16,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:38:16,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:38:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:38:16,850 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 8 states. [2020-11-30 02:38:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:17,353 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2020-11-30 02:38:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:38:17,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-30 02:38:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:17,356 INFO L225 Difference]: With dead ends: 173 [2020-11-30 02:38:17,356 INFO L226 Difference]: Without dead ends: 173 [2020-11-30 02:38:17,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:38:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-30 02:38:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-11-30 02:38:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-11-30 02:38:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 186 transitions. [2020-11-30 02:38:17,366 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 186 transitions. Word has length 22 [2020-11-30 02:38:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:17,367 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 186 transitions. [2020-11-30 02:38:17,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:38:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 186 transitions. [2020-11-30 02:38:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 02:38:17,369 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:17,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:17,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:17,983 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:17,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1220284955, now seen corresponding path program 1 times [2020-11-30 02:38:17,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:17,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582337142] [2020-11-30 02:38:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:18,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 02:38:18,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:18,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:20,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582337142] [2020-11-30 02:38:20,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1975749855] [2020-11-30 02:38:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:20,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:38:20,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:20,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:20,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682834945] [2020-11-30 02:38:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:38:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:20,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 02:38:20,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:20,828 INFO L350 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2020-11-30 02:38:20,828 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2020-11-30 02:38:20,829 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:20,874 INFO L625 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2020-11-30 02:38:20,876 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 02:38:20,878 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:20,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:12, output treesize:23 [2020-11-30 02:38:20,879 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 02:38:20,923 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 02:38:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:21,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:21,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:38:21,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 11 [2020-11-30 02:38:21,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189766982] [2020-11-30 02:38:21,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 02:38:21,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:21,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 02:38:21,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=96, Unknown=1, NotChecked=0, Total=132 [2020-11-30 02:38:21,180 INFO L87 Difference]: Start difference. First operand 173 states and 186 transitions. Second operand 12 states. [2020-11-30 02:38:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:38:22,831 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2020-11-30 02:38:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:38:22,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-11-30 02:38:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:38:22,834 INFO L225 Difference]: With dead ends: 175 [2020-11-30 02:38:22,834 INFO L226 Difference]: Without dead ends: 158 [2020-11-30 02:38:22,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2020-11-30 02:38:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-11-30 02:38:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-11-30 02:38:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-11-30 02:38:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2020-11-30 02:38:22,841 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 23 [2020-11-30 02:38:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:38:22,842 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2020-11-30 02:38:22,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 02:38:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2020-11-30 02:38:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 02:38:22,843 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:38:22,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:38:23,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:23,458 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:38:23,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:38:23,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1003285901, now seen corresponding path program 1 times [2020-11-30 02:38:23,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:38:23,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665175134] [2020-11-30 02:38:23,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-11-30 02:38:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:23,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 02:38:23,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:23,593 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:38:23,593 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:23,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:23,623 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:23,623 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:38:23,677 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:23,677 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 02:38:23,678 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:23,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:23,695 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:23,696 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2020-11-30 02:38:23,735 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:38:23,735 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:23,757 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:23,758 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:23,758 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2020-11-30 02:38:23,930 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:23,930 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2020-11-30 02:38:23,931 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:23,983 INFO L625 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-11-30 02:38:23,984 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:23,984 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2020-11-30 02:38:24,150 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2020-11-30 02:38:24,151 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 02:38:24,152 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2020-11-30 02:38:24,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 02:38:24,155 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:24,222 INFO L625 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2020-11-30 02:38:24,223 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:24,223 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2020-11-30 02:38:24,312 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:24,313 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-11-30 02:38:24,313 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:24,336 INFO L625 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2020-11-30 02:38:24,339 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:24,339 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2020-11-30 02:38:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:24,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:24,421 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:24,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:24,429 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:24,429 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2020-11-30 02:38:30,597 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 18 [2020-11-30 02:38:32,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~item~0.offset (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) ULTIMATE.start_main_~item~0.offset (_ bv0 32)) (bvadd ULTIMATE.start_main_~item~0.offset (_ bv4 32)) v_DerPreprocessor_17)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset) (_ bv0 32)))) is different from false [2020-11-30 02:38:34,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~item~0.offset_75 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32))) (not (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_main_~item~0.offset_75 (_ bv0 32)) (bvadd v_ULTIMATE.start_main_~item~0.offset_75 (_ bv4 32)) v_DerPreprocessor_17))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset) (_ bv0 32)))) is different from false [2020-11-30 02:38:34,658 INFO L384 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 350 treesize of output 342 [2020-11-30 02:38:34,664 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 02:38:34,947 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-11-30 02:38:34,956 INFO L625 ElimStorePlain]: treesize reduction 273, result has 17.3 percent of original size [2020-11-30 02:38:34,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:38:34,967 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2020-11-30 02:38:34,967 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:36 [2020-11-30 02:38:34,998 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 02:38:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:35,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665175134] [2020-11-30 02:38:35,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1141855417] [2020-11-30 02:38:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:38:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:35,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 02:38:35,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:35,458 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:38:35,458 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:35,472 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:35,473 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:35,473 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 02:38:35,600 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:35,601 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 02:38:35,601 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:35,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:35,634 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:35,634 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:18 [2020-11-30 02:38:35,724 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:38:35,724 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:35,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:35,752 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:35,752 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2020-11-30 02:38:35,978 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:35,978 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2020-11-30 02:38:35,979 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:36,016 INFO L625 ElimStorePlain]: treesize reduction 24, result has 52.0 percent of original size [2020-11-30 02:38:36,016 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:36,016 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:26 [2020-11-30 02:38:36,227 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2020-11-30 02:38:36,227 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 02:38:36,228 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2020-11-30 02:38:36,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 02:38:36,230 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:36,300 INFO L625 ElimStorePlain]: treesize reduction 32, result has 49.2 percent of original size [2020-11-30 02:38:36,300 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:36,301 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:31 [2020-11-30 02:38:36,486 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:36,487 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-11-30 02:38:36,488 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:36,525 INFO L625 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2020-11-30 02:38:36,527 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:36,527 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2020-11-30 02:38:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:36,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:36,542 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:36,555 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:36,556 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:36,556 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2020-11-30 02:38:38,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~item~0.offset_79 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32))) (not (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_main_~item~0.offset_79 (_ bv0 32)) (bvadd v_ULTIMATE.start_main_~item~0.offset_79 (_ bv4 32)) v_DerPreprocessor_17))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset) (_ bv0 32)))) is different from false [2020-11-30 02:38:38,673 INFO L384 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 166 treesize of output 162 [2020-11-30 02:38:38,674 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 02:38:38,917 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2020-11-30 02:38:38,918 INFO L625 ElimStorePlain]: treesize reduction 100, result has 35.9 percent of original size [2020-11-30 02:38:38,920 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2020-11-30 02:38:38,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2020-11-30 02:38:38,981 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 02:38:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:39,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044585448] [2020-11-30 02:38:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:38:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:38:39,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 02:38:39,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:38:39,155 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:38:39,155 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:39,159 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,159 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:38:39,178 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:39,178 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 02:38:39,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:38:39,182 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:39,198 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,198 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2020-11-30 02:38:39,209 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 02:38:39,209 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,231 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:39,231 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,232 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2020-11-30 02:38:39,282 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:39,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2020-11-30 02:38:39,283 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,323 INFO L625 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-11-30 02:38:39,323 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,323 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2020-11-30 02:38:39,464 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2020-11-30 02:38:39,464 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 02:38:39,465 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2020-11-30 02:38:39,467 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 02:38:39,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 02:38:39,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 02:38:39,471 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 02:38:39,526 INFO L625 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2020-11-30 02:38:39,527 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:39,527 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2020-11-30 02:38:39,585 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:39,585 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-11-30 02:38:39,586 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,608 INFO L625 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2020-11-30 02:38:39,610 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:38:39,610 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2020-11-30 02:38:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:39,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:38:39,624 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:39,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:38:39,635 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:38:39,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2020-11-30 02:38:44,567 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2020-11-30 02:38:44,584 INFO L384 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 350 treesize of output 342 [2020-11-30 02:38:44,587 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 02:38:44,884 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2020-11-30 02:38:44,885 INFO L625 ElimStorePlain]: treesize reduction 274, result has 17.0 percent of original size [2020-11-30 02:38:44,917 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2020-11-30 02:38:44,917 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2020-11-30 02:38:44,933 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 02:38:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:38:44,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 02:38:44,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11, 11] total 28 [2020-11-30 02:38:44,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486535676] [2020-11-30 02:38:44,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-30 02:38:44,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:38:44,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-30 02:38:44,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=505, Unknown=5, NotChecked=144, Total=756 [2020-11-30 02:38:44,997 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand 28 states. [2020-11-30 02:38:49,313 WARN L193 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-11-30 02:38:55,279 WARN L193 SmtUtils]: Spent 5.89 s on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-11-30 02:39:00,329 WARN L193 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-11-30 02:39:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:39:12,237 INFO L93 Difference]: Finished difference Result 186 states and 203 transitions. [2020-11-30 02:39:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 02:39:12,238 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2020-11-30 02:39:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:39:12,240 INFO L225 Difference]: With dead ends: 186 [2020-11-30 02:39:12,240 INFO L226 Difference]: Without dead ends: 186 [2020-11-30 02:39:12,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 123 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=189, Invalid=748, Unknown=5, NotChecked=180, Total=1122 [2020-11-30 02:39:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-11-30 02:39:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2020-11-30 02:39:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-11-30 02:39:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2020-11-30 02:39:12,246 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 27 [2020-11-30 02:39:12,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:39:12,246 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2020-11-30 02:39:12,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-30 02:39:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2020-11-30 02:39:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 02:39:12,247 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:39:12,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:39:12,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:39:12,849 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:39:12,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:39:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2086963445, now seen corresponding path program 1 times [2020-11-30 02:39:12,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:39:12,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670313176] [2020-11-30 02:39:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2020-11-30 02:39:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:39:12,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 02:39:12,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:39:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:39:13,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:39:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:39:13,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670313176] [2020-11-30 02:39:13,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:39:13,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 02:39:13,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286427281] [2020-11-30 02:39:13,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:39:13,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 02:39:13,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:39:13,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:39:13,012 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 3 states. [2020-11-30 02:39:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:39:13,062 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2020-11-30 02:39:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:39:13,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 02:39:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:39:13,065 INFO L225 Difference]: With dead ends: 215 [2020-11-30 02:39:13,065 INFO L226 Difference]: Without dead ends: 215 [2020-11-30 02:39:13,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:39:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-11-30 02:39:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 174. [2020-11-30 02:39:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-11-30 02:39:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2020-11-30 02:39:13,076 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 28 [2020-11-30 02:39:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:39:13,077 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2020-11-30 02:39:13,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:39:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2020-11-30 02:39:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 02:39:13,084 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:39:13,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:39:13,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-11-30 02:39:13,304 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 02:39:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:39:13,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1177705473, now seen corresponding path program 1 times [2020-11-30 02:39:13,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 02:39:13,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174957689] [2020-11-30 02:39:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2020-11-30 02:39:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:39:13,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 02:39:13,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:39:13,447 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:39:13,447 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:13,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:13,451 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:13,451 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:39:13,519 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:13,519 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-11-30 02:39:13,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:39:13,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:39:13,534 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:13,584 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2020-11-30 02:39:13,584 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:13,584 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2020-11-30 02:39:13,633 INFO L384 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 11 treesize of output 7 [2020-11-30 02:39:13,634 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:13,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:13,654 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:13,654 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:33 [2020-11-30 02:39:13,763 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:13,763 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 53 [2020-11-30 02:39:13,764 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:13,814 INFO L625 ElimStorePlain]: treesize reduction 24, result has 57.9 percent of original size [2020-11-30 02:39:13,814 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:13,814 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:33 [2020-11-30 02:39:13,967 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 02:39:13,968 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 81 [2020-11-30 02:39:13,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 02:39:13,970 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:14,009 INFO L625 ElimStorePlain]: treesize reduction 32, result has 54.3 percent of original size [2020-11-30 02:39:14,010 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:14,010 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:38 [2020-11-30 02:39:14,109 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:14,109 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2020-11-30 02:39:14,110 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:14,137 INFO L625 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2020-11-30 02:39:14,138 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:14,139 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:17 [2020-11-30 02:39:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:39:14,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:39:14,294 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:14,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:14,306 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:14,306 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2020-11-30 02:39:18,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_20 (_ BitVec 32)) (ULTIMATE.start_main_~item~0.offset (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base) ULTIMATE.start_main_~item~0.offset (_ bv0 32)) (bvadd ULTIMATE.start_main_~item~0.offset (_ bv4 32)) v_DerPreprocessor_20)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))) is different from false [2020-11-30 02:39:36,520 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2020-11-30 02:39:36,525 INFO L384 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 202 treesize of output 198 [2020-11-30 02:39:36,527 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:36,801 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-30 02:39:36,802 INFO L625 ElimStorePlain]: treesize reduction 58, result has 70.7 percent of original size [2020-11-30 02:39:36,803 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:36,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:36,805 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:36,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:36,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:36,807 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:36,810 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:36,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:36,812 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:36,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:36,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:36,814 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:36,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:36,818 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:36,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:36,820 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:39:36,821 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:36,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:36,838 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:39:36,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:39:36,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174957689] [2020-11-30 02:39:36,841 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unsupported sort (_ BitVec 32) [2020-11-30 02:39:36,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [898236968] [2020-11-30 02:39:36,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 02:39:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:39:37,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 02:39:37,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:39:37,104 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:39:37,104 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:37,110 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:37,111 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:37,111 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 02:39:37,220 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:37,220 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-11-30 02:39:37,221 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:37,270 INFO L625 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-11-30 02:39:37,271 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:37,271 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2020-11-30 02:39:37,331 INFO L384 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 11 treesize of output 7 [2020-11-30 02:39:37,331 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:37,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:37,355 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:37,355 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2020-11-30 02:39:37,604 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:37,604 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 53 [2020-11-30 02:39:37,605 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:37,648 INFO L625 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2020-11-30 02:39:37,648 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:37,648 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:36 [2020-11-30 02:39:37,807 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 02:39:37,807 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 81 [2020-11-30 02:39:37,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 02:39:37,809 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:37,859 INFO L625 ElimStorePlain]: treesize reduction 32, result has 56.2 percent of original size [2020-11-30 02:39:37,859 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:37,859 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2020-11-30 02:39:38,002 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:38,002 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2020-11-30 02:39:38,003 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:38,030 INFO L625 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2020-11-30 02:39:38,030 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:38,031 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2020-11-30 02:39:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:39:38,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:39:38,059 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:38,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:38,065 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:38,065 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2020-11-30 02:39:48,507 INFO L384 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 202 treesize of output 198 [2020-11-30 02:39:48,508 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:48,776 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-30 02:39:48,777 INFO L625 ElimStorePlain]: treesize reduction 58, result has 70.7 percent of original size [2020-11-30 02:39:48,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,781 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,783 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,784 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,785 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,786 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,789 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,791 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,793 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,806 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,809 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,813 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,816 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:39:48,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,818 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:39:48,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:48,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:39:48,822 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unsupported sort (_ BitVec 32) [2020-11-30 02:39:48,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238926948] [2020-11-30 02:39:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af249a0c-0224-46ba-b5a5-6b9d8d747550/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:39:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:39:48,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 02:39:48,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:39:48,936 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 02:39:48,937 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:48,953 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:48,953 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:48,953 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 02:39:48,970 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:48,970 INFO L384 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 13 treesize of output 17 [2020-11-30 02:39:48,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:39:48,978 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:48,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:48,993 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:48,993 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2020-11-30 02:39:49,059 INFO L384 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 11 treesize of output 7 [2020-11-30 02:39:49,059 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:49,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:49,078 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:49,079 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2020-11-30 02:39:51,295 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:51,296 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2020-11-30 02:39:51,296 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:51,357 INFO L625 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2020-11-30 02:39:51,357 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:51,357 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2020-11-30 02:39:51,609 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2020-11-30 02:39:51,610 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 02:39:51,610 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2020-11-30 02:39:51,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 02:39:51,612 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:51,654 INFO L625 ElimStorePlain]: treesize reduction 32, result has 47.5 percent of original size [2020-11-30 02:39:51,655 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:51,655 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:29 [2020-11-30 02:39:51,819 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:51,819 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2020-11-30 02:39:51,820 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:51,841 INFO L625 ElimStorePlain]: treesize reduction 12, result has 50.0 percent of original size [2020-11-30 02:39:51,842 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 02:39:51,843 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2020-11-30 02:39:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:39:51,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:39:51,870 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:51,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:51,879 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:51,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2020-11-30 02:39:52,151 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:52,151 INFO L384 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 29 treesize of output 33 [2020-11-30 02:39:52,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:39:52,154 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 02:39:52,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 02:39:52,160 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 02:39:52,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2020-11-30 02:40:21,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_20 (_ BitVec 32)) (v_ULTIMATE.start_main_~item~0.offset_94 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_main_~item~0.offset_94 (_ bv0 32)) (bvadd v_ULTIMATE.start_main_~item~0.offset_94 (_ bv4 32)) v_DerPreprocessor_20)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))) is different from false [2020-11-30 02:40:21,700 INFO L384 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 694 treesize of output 678 [2020-11-30 02:40:21,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,701 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:21,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,721 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:21,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,722 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:40:21,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,726 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:40:21,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:40:21,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,769 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:21,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,806 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:21,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:40:21,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,820 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:40:21,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:40:21,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,834 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:21,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,842 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:21,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:40:21,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,852 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:40:21,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:40:21,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:40:21,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,872 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:40:21,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:40:21,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,883 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:21,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,889 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:21,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,895 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:21,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:21,905 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 02:40:22,672 WARN L193 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 31 [2020-11-30 02:40:22,673 INFO L625 ElimStorePlain]: treesize reduction 4159, result has 2.4 percent of original size [2020-11-30 02:40:22,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:40:22,674 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 02:40:22,674 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 02:40:22,675 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unsupported sort (_ BitVec 32) [2020-11-30 02:40:22,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:40:22,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-11-30 02:40:22,675 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-11-30 02:40:22,675 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:40:23,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 cvc4 --incremental --print-success --lang smt --rewrite-divk,24 mathsat -unsat_core_generation=3 [2020-11-30 02:40:23,299 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-11-30 02:40:23,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:40:23 BoogieIcfgContainer [2020-11-30 02:40:23,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:40:23,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:40:23,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:40:23,301 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:40:23,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:38:00" (3/4) ... [2020-11-30 02:40:23,306 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 02:40:23,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:40:23,308 INFO L168 Benchmark]: Toolchain (without parser) took 145056.90 ms. Allocated memory was 75.5 MB in the beginning and 121.6 MB in the end (delta: 46.1 MB). Free memory was 39.3 MB in the beginning and 74.5 MB in the end (delta: -35.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:40:23,308 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 75.5 MB. Free memory was 57.3 MB in the beginning and 57.3 MB in the end (delta: 67.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:40:23,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.32 ms. Allocated memory is still 75.5 MB. Free memory was 59.7 MB in the beginning and 45.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:40:23,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.91 ms. Allocated memory is still 75.5 MB. Free memory was 45.3 MB in the beginning and 43.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:40:23,313 INFO L168 Benchmark]: Boogie Preprocessor took 100.81 ms. Allocated memory is still 75.5 MB. Free memory was 43.0 MB in the beginning and 40.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:40:23,313 INFO L168 Benchmark]: RCFGBuilder took 1508.03 ms. Allocated memory was 75.5 MB in the beginning and 100.7 MB in the end (delta: 25.2 MB). Free memory was 40.4 MB in the beginning and 68.3 MB in the end (delta: -27.9 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:40:23,314 INFO L168 Benchmark]: TraceAbstraction took 142578.51 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 68.3 MB in the beginning and 75.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 57.9 MB. Max. memory is 16.1 GB. [2020-11-30 02:40:23,314 INFO L168 Benchmark]: Witness Printer took 5.41 ms. Allocated memory is still 121.6 MB. Free memory was 75.5 MB in the beginning and 74.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:40:23,325 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.39 ms. Allocated memory is still 75.5 MB. Free memory was 57.3 MB in the beginning and 57.3 MB in the end (delta: 67.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 715.32 ms. Allocated memory is still 75.5 MB. Free memory was 59.7 MB in the beginning and 45.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 115.91 ms. Allocated memory is still 75.5 MB. Free memory was 45.3 MB in the beginning and 43.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 100.81 ms. Allocated memory is still 75.5 MB. Free memory was 43.0 MB in the beginning and 40.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1508.03 ms. Allocated memory was 75.5 MB in the beginning and 100.7 MB in the end (delta: 25.2 MB). Free memory was 40.4 MB in the beginning and 68.3 MB in the end (delta: -27.9 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 142578.51 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 68.3 MB in the beginning and 75.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 57.9 MB. Max. memory is 16.1 GB. * Witness Printer took 5.41 ms. Allocated memory is still 121.6 MB. Free memory was 75.5 MB in the beginning and 74.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) [L998] head->data = 0 [L999] SLL* item = head; [L1000] int status = 0; [L1002] COND TRUE __VERIFIER_nondet_int() [L1004] item->next = malloc(sizeof(SLL)) [L1005] EXPR item->next [L1005] item = item->next [L1006] item->next = ((void*)0) [L1008] COND TRUE !status [L1010] item->data = 1 [L1011] status = 1 [L1024] COND FALSE !(!(head != ((void*)0))) [L1025] COND FALSE !(!(item != ((void*)0))) [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] COND FALSE !(!(head != ((void*)0))) [L1029] COND TRUE status == 1 [L1031] COND FALSE !(!(head != ((void*)0))) [L1032] EXPR head->next [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1034] COND FALSE !(status == 2) [L1040] COND FALSE !(status == 3) [L1049] EXPR head->next [L1049] item = head->next [L1051] COND TRUE item && __VERIFIER_nondet_int() [L1053] !status || item->data > 0 [L1053] item->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 195 locations, 70 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 142.4s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 37.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2129 SDtfs, 3181 SDslu, 5319 SDs, 0 SdLazy, 3034 SolverSat, 130 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 752 GetRequests, 621 SyntacticMatches, 15 SemanticMatches, 116 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 35.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 537 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 27.3s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 718 ConstructedInterpolants, 86 QuantifiedInterpolants, 143791 SizeOfPredicates, 134 NumberOfNonLiveVariables, 1568 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 44 InterpolantComputations, 26 PerfectInterpolantSequences, 8/26 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...