./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/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 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 17:01:19,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 17:01:19,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 17:01:19,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 17:01:19,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 17:01:19,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 17:01:19,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 17:01:19,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 17:01:19,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 17:01:19,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 17:01:19,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 17:01:19,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 17:01:19,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 17:01:19,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 17:01:19,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 17:01:19,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 17:01:19,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 17:01:19,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 17:01:19,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 17:01:19,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 17:01:19,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 17:01:19,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 17:01:19,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 17:01:19,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 17:01:19,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 17:01:19,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 17:01:19,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 17:01:19,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 17:01:19,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 17:01:19,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 17:01:19,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 17:01:19,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 17:01:19,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 17:01:19,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 17:01:19,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 17:01:19,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 17:01:19,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 17:01:19,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 17:01:19,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 17:01:19,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 17:01:19,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 17:01:19,618 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2020-12-09 17:01:19,640 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 17:01:19,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 17:01:19,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 17:01:19,642 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 17:01:19,642 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 17:01:19,642 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 17:01:19,642 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 17:01:19,642 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 17:01:19,643 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 17:01:19,643 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 17:01:19,643 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 17:01:19,643 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 17:01:19,643 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 17:01:19,644 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 17:01:19,644 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 17:01:19,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 17:01:19,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 17:01:19,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 17:01:19,645 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 17:01:19,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 17:01:19,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 17:01:19,645 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 17:01:19,646 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 17:01:19,646 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 17:01:19,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 17:01:19,646 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 17:01:19,646 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 17:01:19,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 17:01:19,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 17:01:19,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 17:01:19,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 17:01:19,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 17:01:19,648 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 17:01:19,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 17:01:19,648 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 17:01:19,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 17:01:19,648 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_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/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_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2020-12-09 17:01:19,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 17:01:19,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 17:01:19,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 17:01:19,856 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 17:01:19,857 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 17:01:19,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-12-09 17:01:19,898 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/data/d657a9932/1fe5dc0fc0f242608f49dbc9ad5ffa69/FLAGfc7dfd9e8 [2020-12-09 17:01:20,258 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 17:01:20,259 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-12-09 17:01:20,263 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/data/d657a9932/1fe5dc0fc0f242608f49dbc9ad5ffa69/FLAGfc7dfd9e8 [2020-12-09 17:01:20,276 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/data/d657a9932/1fe5dc0fc0f242608f49dbc9ad5ffa69 [2020-12-09 17:01:20,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 17:01:20,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 17:01:20,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 17:01:20,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 17:01:20,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 17:01:20,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66379811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20, skipping insertion in model container [2020-12-09 17:01:20,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 17:01:20,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 17:01:20,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:01:20,407 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 17:01:20,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 17:01:20,433 INFO L208 MainTranslator]: Completed translation [2020-12-09 17:01:20,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20 WrapperNode [2020-12-09 17:01:20,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 17:01:20,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 17:01:20,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 17:01:20,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 17:01:20,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 17:01:20,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 17:01:20,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 17:01:20,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 17:01:20,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... [2020-12-09 17:01:20,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 17:01:20,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 17:01:20,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 17:01:20,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 17:01:20,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/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-12-09 17:01:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 17:01:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 17:01:20,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 17:01:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 17:01:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 17:01:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 17:01:20,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 17:01:20,779 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2020-12-09 17:01:20,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:01:20 BoogieIcfgContainer [2020-12-09 17:01:20,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 17:01:20,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 17:01:20,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 17:01:20,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 17:01:20,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:01:20" (1/3) ... [2020-12-09 17:01:20,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479a7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:01:20, skipping insertion in model container [2020-12-09 17:01:20,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:20" (2/3) ... [2020-12-09 17:01:20,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479a7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:01:20, skipping insertion in model container [2020-12-09 17:01:20,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:01:20" (3/3) ... [2020-12-09 17:01:20,788 INFO L111 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2020-12-09 17:01:20,798 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 17:01:20,800 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2020-12-09 17:01:20,808 INFO L253 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2020-12-09 17:01:20,823 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 17:01:20,823 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 17:01:20,823 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 17:01:20,823 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 17:01:20,823 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 17:01:20,824 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 17:01:20,824 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 17:01:20,824 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 17:01:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2020-12-09 17:01:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2020-12-09 17:01:20,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:20,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1] [2020-12-09 17:01:20,841 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:20,845 INFO L82 PathProgramCache]: Analyzing trace with hash 3476, now seen corresponding path program 1 times [2020-12-09 17:01:20,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:20,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583749430] [2020-12-09 17:01:20,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:20,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583749430] [2020-12-09 17:01:20,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:01:20,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 17:01:20,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829808100] [2020-12-09 17:01:20,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:01:20,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:01:20,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:01:20,991 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2020-12-09 17:01:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:21,053 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2020-12-09 17:01:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:01:21,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2020-12-09 17:01:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:21,062 INFO L225 Difference]: With dead ends: 50 [2020-12-09 17:01:21,067 INFO L226 Difference]: Without dead ends: 49 [2020-12-09 17:01:21,068 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-12-09 17:01:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-12-09 17:01:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-12-09 17:01:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 17:01:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2020-12-09 17:01:21,093 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 2 [2020-12-09 17:01:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:21,094 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2020-12-09 17:01:21,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:01:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-12-09 17:01:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2020-12-09 17:01:21,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:21,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1] [2020-12-09 17:01:21,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 17:01:21,095 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:21,096 INFO L82 PathProgramCache]: Analyzing trace with hash 3477, now seen corresponding path program 1 times [2020-12-09 17:01:21,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:21,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465972407] [2020-12-09 17:01:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:21,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465972407] [2020-12-09 17:01:21,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:01:21,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 17:01:21,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117980986] [2020-12-09 17:01:21,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:01:21,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:01:21,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:01:21,142 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2020-12-09 17:01:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:21,182 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2020-12-09 17:01:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:01:21,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2020-12-09 17:01:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:21,184 INFO L225 Difference]: With dead ends: 45 [2020-12-09 17:01:21,184 INFO L226 Difference]: Without dead ends: 45 [2020-12-09 17:01:21,184 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-12-09 17:01:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-09 17:01:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-12-09 17:01:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 17:01:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-12-09 17:01:21,189 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 2 [2020-12-09 17:01:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:21,190 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-12-09 17:01:21,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:01:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-12-09 17:01:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 17:01:21,190 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:21,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 17:01:21,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 17:01:21,191 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash 107732, now seen corresponding path program 1 times [2020-12-09 17:01:21,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:21,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608324563] [2020-12-09 17:01:21,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:21,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608324563] [2020-12-09 17:01:21,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:01:21,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 17:01:21,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062269430] [2020-12-09 17:01:21,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:01:21,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:21,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:01:21,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:01:21,229 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2020-12-09 17:01:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:21,266 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2020-12-09 17:01:21,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:01:21,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 17:01:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:21,267 INFO L225 Difference]: With dead ends: 41 [2020-12-09 17:01:21,267 INFO L226 Difference]: Without dead ends: 41 [2020-12-09 17:01:21,268 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-12-09 17:01:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-09 17:01:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-12-09 17:01:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 17:01:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-12-09 17:01:21,272 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 3 [2020-12-09 17:01:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:21,272 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-12-09 17:01:21,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:01:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-12-09 17:01:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 17:01:21,273 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:21,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 17:01:21,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 17:01:21,274 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:21,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:21,274 INFO L82 PathProgramCache]: Analyzing trace with hash 107733, now seen corresponding path program 1 times [2020-12-09 17:01:21,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:21,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805740554] [2020-12-09 17:01:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:21,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805740554] [2020-12-09 17:01:21,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:01:21,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 17:01:21,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641673722] [2020-12-09 17:01:21,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:01:21,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:21,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:01:21,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:01:21,316 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2020-12-09 17:01:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:21,343 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-12-09 17:01:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:01:21,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 17:01:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:21,344 INFO L225 Difference]: With dead ends: 37 [2020-12-09 17:01:21,344 INFO L226 Difference]: Without dead ends: 37 [2020-12-09 17:01:21,344 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-12-09 17:01:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-09 17:01:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-12-09 17:01:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 17:01:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2020-12-09 17:01:21,347 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 3 [2020-12-09 17:01:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:21,347 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2020-12-09 17:01:21,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:01:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-12-09 17:01:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 17:01:21,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:21,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 17:01:21,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 17:01:21,348 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash 3339671, now seen corresponding path program 1 times [2020-12-09 17:01:21,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:21,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467614142] [2020-12-09 17:01:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:21,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467614142] [2020-12-09 17:01:21,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:01:21,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 17:01:21,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010074722] [2020-12-09 17:01:21,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:01:21,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:01:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:01:21,372 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 3 states. [2020-12-09 17:01:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:21,406 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-12-09 17:01:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:01:21,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 17:01:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:21,407 INFO L225 Difference]: With dead ends: 33 [2020-12-09 17:01:21,408 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 17:01:21,408 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-12-09 17:01:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 17:01:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-12-09 17:01:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 17:01:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-12-09 17:01:21,412 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 4 [2020-12-09 17:01:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:21,412 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-12-09 17:01:21,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:01:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-12-09 17:01:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 17:01:21,412 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:21,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 17:01:21,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 17:01:21,413 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:21,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash 3339672, now seen corresponding path program 1 times [2020-12-09 17:01:21,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:21,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119800065] [2020-12-09 17:01:21,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:21,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119800065] [2020-12-09 17:01:21,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:01:21,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 17:01:21,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576038349] [2020-12-09 17:01:21,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:01:21,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:01:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:01:21,450 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2020-12-09 17:01:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:21,478 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-12-09 17:01:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:01:21,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 17:01:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:21,479 INFO L225 Difference]: With dead ends: 29 [2020-12-09 17:01:21,479 INFO L226 Difference]: Without dead ends: 29 [2020-12-09 17:01:21,480 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-12-09 17:01:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-12-09 17:01:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-12-09 17:01:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 17:01:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-12-09 17:01:21,483 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 4 [2020-12-09 17:01:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:21,483 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-12-09 17:01:21,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:01:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-12-09 17:01:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 17:01:21,484 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:21,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 17:01:21,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 17:01:21,484 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:21,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:21,485 INFO L82 PathProgramCache]: Analyzing trace with hash 103529783, now seen corresponding path program 1 times [2020-12-09 17:01:21,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:21,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197704587] [2020-12-09 17:01:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:21,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197704587] [2020-12-09 17:01:21,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:01:21,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 17:01:21,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782898054] [2020-12-09 17:01:21,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:01:21,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:21,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:01:21,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:01:21,510 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2020-12-09 17:01:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:21,537 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-12-09 17:01:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:01:21,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 17:01:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:21,539 INFO L225 Difference]: With dead ends: 26 [2020-12-09 17:01:21,539 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 17:01:21,539 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-12-09 17:01:21,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 17:01:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-09 17:01:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 17:01:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-09 17:01:21,542 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2020-12-09 17:01:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:21,542 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-09 17:01:21,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:01:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-09 17:01:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 17:01:21,543 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:21,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 17:01:21,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 17:01:21,543 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:21,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash 103529784, now seen corresponding path program 1 times [2020-12-09 17:01:21,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:21,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908819053] [2020-12-09 17:01:21,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:21,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908819053] [2020-12-09 17:01:21,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:01:21,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 17:01:21,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868408064] [2020-12-09 17:01:21,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 17:01:21,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:21,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 17:01:21,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 17:01:21,577 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2020-12-09 17:01:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:21,592 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-12-09 17:01:21,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 17:01:21,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 17:01:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:21,593 INFO L225 Difference]: With dead ends: 23 [2020-12-09 17:01:21,593 INFO L226 Difference]: Without dead ends: 23 [2020-12-09 17:01:21,594 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-12-09 17:01:21,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-12-09 17:01:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-12-09 17:01:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-12-09 17:01:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-12-09 17:01:21,596 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 5 [2020-12-09 17:01:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:21,596 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-12-09 17:01:21,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 17:01:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-12-09 17:01:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 17:01:21,597 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:21,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:01:21,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 17:01:21,597 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1661417693, now seen corresponding path program 1 times [2020-12-09 17:01:21,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:21,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35784934] [2020-12-09 17:01:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,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-12-09 17:01:21,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35784934] [2020-12-09 17:01:21,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:01:21,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 17:01:21,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907994868] [2020-12-09 17:01:21,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:01:21,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:01:21,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:01:21,626 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2020-12-09 17:01:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:21,676 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-12-09 17:01:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 17:01:21,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 17:01:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:21,677 INFO L225 Difference]: With dead ends: 38 [2020-12-09 17:01:21,677 INFO L226 Difference]: Without dead ends: 38 [2020-12-09 17:01:21,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 17:01:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-09 17:01:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2020-12-09 17:01:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-09 17:01:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-12-09 17:01:21,679 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2020-12-09 17:01:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:21,680 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-12-09 17:01:21,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:01:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-12-09 17:01:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 17:01:21,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:21,680 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:01:21,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 17:01:21,680 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:21,681 INFO L82 PathProgramCache]: Analyzing trace with hash -723063482, now seen corresponding path program 1 times [2020-12-09 17:01:21,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:21,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575625380] [2020-12-09 17:01:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:21,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575625380] [2020-12-09 17:01:21,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982666715] [2020-12-09 17:01:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/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-12-09 17:01:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:21,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 17:01:21,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:01:21,893 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-12-09 17:01:21,898 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 17:01:21,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:01:21,906 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 17:01:21,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2020-12-09 17:01:21,920 INFO L382 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-12-09 17:01:21,921 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 17:01:21,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:01:21,926 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 17:01:21,926 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-09 17:01:21,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 17:01:21,984 INFO L382 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 19 treesize of output 18 [2020-12-09 17:01:21,986 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 17:01:21,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:01:21,994 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 17:01:21,994 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2020-12-09 17:01:22,032 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-09 17:01:22,035 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 17:01:22,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:01:22,040 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 17:01:22,040 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-12-09 17:01:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:22,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:01:22,461 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x0~0.offset Int)) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~x0~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) c_ULTIMATE.start_main_~x3~0.base) c_ULTIMATE.start_main_~x3~0.offset) 0)) is different from false [2020-12-09 17:01:22,479 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 17:01:22,482 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 17:01:22,483 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 17:01:22,483 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:4 [2020-12-09 17:01:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 17:01:22,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [46185657] [2020-12-09 17:01:22,501 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-12-09 17:01:22,501 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 17:01:22,504 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 17:01:22,508 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 17:01:22,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 17:01:23,008 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 17:01:23,248 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2020-12-09 17:01:23,501 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-12-09 17:01:23,771 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2020-12-09 17:01:24,049 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2020-12-09 17:01:24,998 WARN L197 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 87 [2020-12-09 17:01:25,984 WARN L197 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 89 [2020-12-09 17:01:27,020 WARN L197 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 94 [2020-12-09 17:01:27,470 WARN L197 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 82 [2020-12-09 17:01:27,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 17:01:27,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 5, 5] total 15 [2020-12-09 17:01:27,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031003147] [2020-12-09 17:01:27,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 17:01:27,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:27,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 17:01:27,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=148, Unknown=1, NotChecked=26, Total=240 [2020-12-09 17:01:27,473 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 10 states. [2020-12-09 17:01:27,901 WARN L197 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2020-12-09 17:01:28,284 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-12-09 17:01:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:28,528 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2020-12-09 17:01:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 17:01:28,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-12-09 17:01:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:28,529 INFO L225 Difference]: With dead ends: 75 [2020-12-09 17:01:28,529 INFO L226 Difference]: Without dead ends: 75 [2020-12-09 17:01:28,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=90, Invalid=185, Unknown=1, NotChecked=30, Total=306 [2020-12-09 17:01:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-12-09 17:01:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 32. [2020-12-09 17:01:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 17:01:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-12-09 17:01:28,532 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2020-12-09 17:01:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:28,532 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-12-09 17:01:28,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 17:01:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-12-09 17:01:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 17:01:28,533 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:28,533 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:01:28,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 17:01:28,735 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1385146651, now seen corresponding path program 1 times [2020-12-09 17:01:28,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:28,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754782077] [2020-12-09 17:01:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:29,011 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2020-12-09 17:01:29,142 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2020-12-09 17:01:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:29,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754782077] [2020-12-09 17:01:29,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600642875] [2020-12-09 17:01:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/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-12-09 17:01:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:29,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 17:01:29,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:01:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:29,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:01:32,976 WARN L197 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-12-09 17:01:33,539 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x1~0.offset Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_main_~x0~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~x0~0.base) c_ULTIMATE.start_main_~x0~0.offset 0)))) (store .cse0 c_ULTIMATE.start_main_~x1~0.base (store (select .cse0 c_ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset 1))) c_ULTIMATE.start_main_~x3~0.base) c_ULTIMATE.start_main_~x3~0.offset) 0)) is different from false [2020-12-09 17:01:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 17:01:34,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1790531075] [2020-12-09 17:01:34,533 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 17:01:34,533 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 17:01:34,533 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 17:01:34,534 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 17:01:34,534 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 17:01:35,149 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) 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:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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-12-09 17:01:35,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 17:01:35,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2020-12-09 17:01:35,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91248270] [2020-12-09 17:01:35,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-09 17:01:35,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-09 17:01:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=250, Unknown=10, NotChecked=34, Total=380 [2020-12-09 17:01:35,152 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 20 states. [2020-12-09 17:01:41,658 WARN L197 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-12-09 17:01:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:01:44,081 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2020-12-09 17:01:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 17:01:44,082 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2020-12-09 17:01:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:01:44,082 INFO L225 Difference]: With dead ends: 45 [2020-12-09 17:01:44,082 INFO L226 Difference]: Without dead ends: 45 [2020-12-09 17:01:44,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=214, Invalid=480, Unknown=12, NotChecked=50, Total=756 [2020-12-09 17:01:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-09 17:01:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2020-12-09 17:01:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 17:01:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-12-09 17:01:44,085 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2020-12-09 17:01:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:01:44,086 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-12-09 17:01:44,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-09 17:01:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-12-09 17:01:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 17:01:44,086 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:01:44,087 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:01:44,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:01:44,288 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:01:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:01:44,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1435305227, now seen corresponding path program 1 times [2020-12-09 17:01:44,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:01:44,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474285992] [2020-12-09 17:01:44,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:01:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:44,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474285992] [2020-12-09 17:01:44,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422859862] [2020-12-09 17:01:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/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-12-09 17:01:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:01:44,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 17:01:44,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:01:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:01:45,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:01:47,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x0~0.base Int)) (let ((.cse0 (select |c_#memory_int| ULTIMATE.start_main_~x0~0.base))) (or (= (select (select (store |c_#memory_int| ULTIMATE.start_main_~x0~0.base (store .cse0 c_ULTIMATE.start_main_~x0~0.offset 0)) c_ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0) (not (= (select (select (store |c_#memory_int| ULTIMATE.start_main_~x0~0.base (store .cse0 c_ULTIMATE.start_main_~x0~0.offset 1)) c_ULTIMATE.start_main_~x3~0.base) c_ULTIMATE.start_main_~x3~0.offset) 0))))) is different from false [2020-12-09 17:01:49,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x0~0.base Int) (ULTIMATE.start_main_~x3~0.base Int)) (let ((.cse0 (store |c_#memory_int| ULTIMATE.start_main_~x3~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~x3~0.base) c_ULTIMATE.start_main_~x3~0.offset 0)))) (let ((.cse1 (select .cse0 ULTIMATE.start_main_~x0~0.base))) (or (= (select (select (store .cse0 ULTIMATE.start_main_~x0~0.base (store .cse1 c_ULTIMATE.start_main_~x0~0.offset 0)) c_ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0) (not (= (select (select (store .cse0 ULTIMATE.start_main_~x0~0.base (store .cse1 c_ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x3~0.base) c_ULTIMATE.start_main_~x3~0.offset) 0)))))) is different from false [2020-12-09 17:01:51,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x0~0.base Int) (ULTIMATE.start_main_~x3~0.base Int) (ULTIMATE.start_main_~x2~0.base Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| ULTIMATE.start_main_~x2~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~x2~0.base) c_ULTIMATE.start_main_~x2~0.offset 0)))) (store .cse2 ULTIMATE.start_main_~x3~0.base (store (select .cse2 ULTIMATE.start_main_~x3~0.base) c_ULTIMATE.start_main_~x3~0.offset 0))))) (let ((.cse1 (select .cse0 ULTIMATE.start_main_~x0~0.base))) (or (= (select (select (store .cse0 ULTIMATE.start_main_~x0~0.base (store .cse1 c_ULTIMATE.start_main_~x0~0.offset 0)) c_ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0) (not (= (select (select (store .cse0 ULTIMATE.start_main_~x0~0.base (store .cse1 c_ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x3~0.base) c_ULTIMATE.start_main_~x3~0.offset) 0)))))) is different from false [2020-12-09 17:01:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2020-12-09 17:01:51,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1803579261] [2020-12-09 17:01:51,277 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 17:01:51,277 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 17:01:51,278 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 17:01:51,278 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 17:01:51,278 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 17:01:51,879 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 17:01:52,111 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2020-12-09 17:01:52,409 WARN L197 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-12-09 17:01:52,703 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2020-12-09 17:01:53,037 WARN L197 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2020-12-09 17:01:54,077 WARN L197 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 87 [2020-12-09 17:01:55,139 WARN L197 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 89 [2020-12-09 17:01:56,430 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 144 DAG size of output: 94 [2020-12-09 17:01:56,928 WARN L197 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 82 [2020-12-09 17:01:57,649 WARN L197 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 87 [2020-12-09 17:01:58,380 WARN L197 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 89 [2020-12-09 17:01:58,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 17:01:58,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7, 10, 10] total 34 [2020-12-09 17:01:58,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127221468] [2020-12-09 17:01:58,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 17:01:58,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:01:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 17:01:58,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=686, Unknown=3, NotChecked=180, Total=1122 [2020-12-09 17:01:58,382 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 12 states. [2020-12-09 17:01:58,854 WARN L197 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2020-12-09 17:01:59,336 WARN L197 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-12-09 17:01:59,904 WARN L197 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2020-12-09 17:02:00,400 WARN L197 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2020-12-09 17:02:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:02:00,614 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2020-12-09 17:02:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 17:02:00,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-09 17:02:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:02:00,616 INFO L225 Difference]: With dead ends: 67 [2020-12-09 17:02:00,616 INFO L226 Difference]: Without dead ends: 67 [2020-12-09 17:02:00,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=344, Invalid=855, Unknown=3, NotChecked=204, Total=1406 [2020-12-09 17:02:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-09 17:02:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2020-12-09 17:02:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 17:02:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2020-12-09 17:02:00,619 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 25 [2020-12-09 17:02:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:02:00,619 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2020-12-09 17:02:00,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 17:02:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-12-09 17:02:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 17:02:00,620 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:02:00,620 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:02:00,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:02:00,821 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:02:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:02:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1769996822, now seen corresponding path program 1 times [2020-12-09 17:02:00,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:02:00,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861547553] [2020-12-09 17:02:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:02:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:02:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 17:02:00,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861547553] [2020-12-09 17:02:00,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846670254] [2020-12-09 17:02:00,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:02:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:02:00,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 17:02:00,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:02:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 17:02:01,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:02:03,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~x1~0.base Int)) (let ((.cse1 (store |c_#memory_int| ULTIMATE.start_main_~x1~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset 1)))) (let ((.cse0 (select .cse1 c_ULTIMATE.start_main_~x0~0.base))) (or (= (select .cse0 c_ULTIMATE.start_main_~x0~0.offset) 0) (= (select (select (store .cse1 c_ULTIMATE.start_main_~x0~0.base (store .cse0 c_ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0))))) is different from false [2020-12-09 17:02:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2020-12-09 17:02:03,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224702616] [2020-12-09 17:02:03,199 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2020-12-09 17:02:03,199 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 17:02:03,200 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 17:02:03,200 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 17:02:03,200 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 17:02:03,764 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) 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:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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-12-09 17:02:03,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 17:02:03,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2020-12-09 17:02:03,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647743987] [2020-12-09 17:02:03,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 17:02:03,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:02:03,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 17:02:03,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=242, Unknown=1, NotChecked=32, Total=342 [2020-12-09 17:02:03,766 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 19 states. [2020-12-09 17:02:05,424 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_ULTIMATE.start_main_~x1~0.base))) (and (= c_ULTIMATE.start_main_~x1~0.offset 0) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~x1~0.base (store .cse0 c_ULTIMATE.start_main_~x1~0.offset 1)) c_ULTIMATE.start_main_~x0~0.base) c_ULTIMATE.start_main_~x0~0.offset) 0) (not (= c_ULTIMATE.start_main_~x0~0.base c_ULTIMATE.start_main_~x1~0.base)) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~x0~0.base) c_ULTIMATE.start_main_~x0~0.offset) 0) (= (select .cse0 0) 0) (forall ((ULTIMATE.start_main_~x1~0.base Int)) (let ((.cse2 (store |c_#memory_int| ULTIMATE.start_main_~x1~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset 1)))) (let ((.cse1 (select .cse2 c_ULTIMATE.start_main_~x0~0.base))) (or (= (select .cse1 c_ULTIMATE.start_main_~x0~0.offset) 0) (= (select (select (store .cse2 c_ULTIMATE.start_main_~x0~0.base (store .cse1 c_ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0))))) (= c_ULTIMATE.start_main_~x0~0.offset 0))) is different from false [2020-12-09 17:02:07,428 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x1~0.offset 0) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~x1~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset 1)) c_ULTIMATE.start_main_~x0~0.base) c_ULTIMATE.start_main_~x0~0.offset) 0) (not (= c_ULTIMATE.start_main_~x0~0.base c_ULTIMATE.start_main_~x1~0.base)) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~x0~0.base) c_ULTIMATE.start_main_~x0~0.offset) 0) (forall ((ULTIMATE.start_main_~x1~0.base Int)) (let ((.cse1 (store |c_#memory_int| ULTIMATE.start_main_~x1~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset 1)))) (let ((.cse0 (select .cse1 c_ULTIMATE.start_main_~x0~0.base))) (or (= (select .cse0 c_ULTIMATE.start_main_~x0~0.offset) 0) (= (select (select (store .cse1 c_ULTIMATE.start_main_~x0~0.base (store .cse0 c_ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0))))) (= c_ULTIMATE.start_main_~x0~0.offset 0) (= |c_ULTIMATE.start_main_#t~mem6| 0)) is different from false [2020-12-09 17:02:09,432 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x1~0.offset 0) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~x1~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset 1)) c_ULTIMATE.start_main_~x0~0.base) c_ULTIMATE.start_main_~x0~0.offset) 0) (not (= c_ULTIMATE.start_main_~x0~0.base c_ULTIMATE.start_main_~x1~0.base)) (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~x0~0.base) c_ULTIMATE.start_main_~x0~0.offset) 0) (forall ((ULTIMATE.start_main_~x1~0.base Int)) (let ((.cse1 (store |c_#memory_int| ULTIMATE.start_main_~x1~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset 1)))) (let ((.cse0 (select .cse1 c_ULTIMATE.start_main_~x0~0.base))) (or (= (select .cse0 c_ULTIMATE.start_main_~x0~0.offset) 0) (= (select (select (store .cse1 c_ULTIMATE.start_main_~x0~0.base (store .cse0 c_ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0))))) (= c_ULTIMATE.start_main_~x0~0.offset 0)) is different from false [2020-12-09 17:02:11,548 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select |c_#memory_int| c_ULTIMATE.start_main_~x0~0.base))) (or (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~x0~0.base (store .cse0 c_ULTIMATE.start_main_~x0~0.offset 0)) c_ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0) (= (select .cse0 c_ULTIMATE.start_main_~x0~0.offset) 0))) (forall ((ULTIMATE.start_main_~x1~0.base Int)) (let ((.cse2 (store |c_#memory_int| ULTIMATE.start_main_~x1~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset 1)))) (let ((.cse1 (select .cse2 c_ULTIMATE.start_main_~x0~0.base))) (or (= (select .cse1 c_ULTIMATE.start_main_~x0~0.offset) 0) (= (select (select (store .cse2 c_ULTIMATE.start_main_~x0~0.base (store .cse1 c_ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0)))))) is different from false [2020-12-09 17:02:13,584 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0) (forall ((ULTIMATE.start_main_~x1~0.base Int)) (let ((.cse1 (store |c_#memory_int| ULTIMATE.start_main_~x1~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset 1)))) (let ((.cse0 (select .cse1 c_ULTIMATE.start_main_~x0~0.base))) (or (= (select .cse0 c_ULTIMATE.start_main_~x0~0.offset) 0) (= (select (select (store .cse1 c_ULTIMATE.start_main_~x0~0.base (store .cse0 c_ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0)))))) is different from false [2020-12-09 17:02:14,974 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~x1~0.base Int)) (let ((.cse1 (store |c_#memory_int| ULTIMATE.start_main_~x1~0.base (store (select |c_#memory_int| ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset 1)))) (let ((.cse0 (select .cse1 c_ULTIMATE.start_main_~x0~0.base))) (or (= (select .cse0 c_ULTIMATE.start_main_~x0~0.offset) 0) (= (select (select (store .cse1 c_ULTIMATE.start_main_~x0~0.base (store .cse0 c_ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) c_ULTIMATE.start_main_~x1~0.offset) 0))))) (= |c_ULTIMATE.start_main_#t~mem6| 0)) is different from false [2020-12-09 17:02:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:02:14,976 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2020-12-09 17:02:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 17:02:14,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2020-12-09 17:02:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:02:14,977 INFO L225 Difference]: With dead ends: 59 [2020-12-09 17:02:14,977 INFO L226 Difference]: Without dead ends: 59 [2020-12-09 17:02:14,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=182, Invalid=489, Unknown=7, NotChecked=378, Total=1056 [2020-12-09 17:02:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-09 17:02:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2020-12-09 17:02:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 17:02:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2020-12-09 17:02:14,980 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 33 [2020-12-09 17:02:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:02:14,980 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2020-12-09 17:02:14,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 17:02:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2020-12-09 17:02:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-09 17:02:14,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:02:14,981 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:02:15,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:02:15,183 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 17:02:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:02:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash 257505609, now seen corresponding path program 2 times [2020-12-09 17:02:15,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 17:02:15,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842756270] [2020-12-09 17:02:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 17:02:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:02:15,470 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2020-12-09 17:02:15,581 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-12-09 17:02:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-09 17:02:15,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842756270] [2020-12-09 17:02:15,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520275071] [2020-12-09 17:02:15,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:02:15,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-12-09 17:02:15,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 17:02:15,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 17:02:15,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:02:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-09 17:02:15,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:02:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-09 17:02:15,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 17:02:15,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [9] total 13 [2020-12-09 17:02:15,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102008398] [2020-12-09 17:02:15,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 17:02:15,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 17:02:15,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 17:02:15,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-12-09 17:02:15,957 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2020-12-09 17:02:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:02:16,070 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-12-09 17:02:16,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 17:02:16,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-12-09 17:02:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:02:16,071 INFO L225 Difference]: With dead ends: 56 [2020-12-09 17:02:16,071 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 17:02:16,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-12-09 17:02:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 17:02:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 17:02:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 17:02:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 17:02:16,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-12-09 17:02:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:02:16,072 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 17:02:16,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 17:02:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 17:02:16,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 17:02:16,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:02:16,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:02:16 BoogieIcfgContainer [2020-12-09 17:02:16,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 17:02:16,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 17:02:16,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 17:02:16,289 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 17:02:16,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:01:20" (3/4) ... [2020-12-09 17:02:16,297 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 17:02:16,309 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-09 17:02:16,309 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-09 17:02:16,309 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 17:02:16,333 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c27391d8-9333-443a-8a70-5b5bb0f3bb3b/bin/utaipan/witness.graphml [2020-12-09 17:02:16,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 17:02:16,334 INFO L168 Benchmark]: Toolchain (without parser) took 56054.75 ms. Allocated memory was 98.6 MB in the beginning and 144.7 MB in the end (delta: 46.1 MB). Free memory was 59.2 MB in the beginning and 90.0 MB in the end (delta: -30.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 17:02:16,334 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 98.6 MB. Free memory was 75.5 MB in the beginning and 75.3 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:02:16,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.32 ms. Allocated memory is still 98.6 MB. Free memory was 59.1 MB in the beginning and 76.2 MB in the end (delta: -17.1 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2020-12-09 17:02:16,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.73 ms. Allocated memory is still 98.6 MB. Free memory was 76.2 MB in the beginning and 74.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 17:02:16,335 INFO L168 Benchmark]: Boogie Preprocessor took 20.73 ms. Allocated memory is still 98.6 MB. Free memory was 74.5 MB in the beginning and 73.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:02:16,335 INFO L168 Benchmark]: RCFGBuilder took 293.65 ms. Allocated memory is still 98.6 MB. Free memory was 73.5 MB in the beginning and 63.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 17:02:16,335 INFO L168 Benchmark]: TraceAbstraction took 55504.69 ms. Allocated memory was 98.6 MB in the beginning and 144.7 MB in the end (delta: 46.1 MB). Free memory was 63.3 MB in the beginning and 92.7 MB in the end (delta: -29.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 16.1 GB. [2020-12-09 17:02:16,336 INFO L168 Benchmark]: Witness Printer took 45.50 ms. Allocated memory is still 144.7 MB. Free memory was 92.7 MB in the beginning and 90.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 17:02:16,337 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.16 ms. Allocated memory is still 98.6 MB. Free memory was 75.5 MB in the beginning and 75.3 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 153.32 ms. Allocated memory is still 98.6 MB. Free memory was 59.1 MB in the beginning and 76.2 MB in the end (delta: -17.1 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.73 ms. Allocated memory is still 98.6 MB. Free memory was 76.2 MB in the beginning and 74.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.73 ms. Allocated memory is still 98.6 MB. Free memory was 74.5 MB in the beginning and 73.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 293.65 ms. Allocated memory is still 98.6 MB. Free memory was 73.5 MB in the beginning and 63.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 55504.69 ms. Allocated memory was 98.6 MB in the beginning and 144.7 MB in the end (delta: 46.1 MB). Free memory was 63.3 MB in the beginning and 92.7 MB in the end (delta: -29.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 16.1 GB. * Witness Printer took 45.50 ms. Allocated memory is still 144.7 MB. Free memory was 92.7 MB in the beginning and 90.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 31 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 55.4s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 197 SDtfs, 615 SDslu, 237 SDs, 0 SdLazy, 801 SolverSat, 275 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 230 SyntacticMatches, 29 SemanticMatches, 132 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 46.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 104 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 301 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 409 ConstructedInterpolants, 34 QuantifiedInterpolants, 244649 SizeOfPredicates, 65 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 165/225 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME[ms]: 1110, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 28, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 51, TOOLS_POST_TIME[ms]: 618, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 51, TOOLS_QUANTIFIERELIM_TIME[ms]: 605, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 56, FLUID_QUERY_TIME[ms]: 4, FLUID_QUERIES: 86, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME[ms]: 200, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME[ms]: 160, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME[ms]: 10, DOMAIN_ISBOTTOM_APPLICATIONS: 28, DOMAIN_ISBOTTOM_TIME[ms]: 75, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 360, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 359, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 15, DAG_COMPRESSION_PROCESSED_NODES: 626, DAG_COMPRESSION_RETAINED_NODES: 98, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...