./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0a39eefaccc62f602b71ff7e91e6bcef4799631 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:05:37,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:05:37,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:05:37,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:05:37,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:05:37,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:05:37,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:05:37,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:05:37,067 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:05:37,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:05:37,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:05:37,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:05:37,069 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:05:37,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:05:37,070 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:05:37,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:05:37,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:05:37,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:05:37,072 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:05:37,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:05:37,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:05:37,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:05:37,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:05:37,076 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:05:37,076 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:05:37,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:05:37,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:05:37,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:05:37,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:05:37,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:05:37,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:05:37,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:05:37,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:05:37,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:05:37,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:05:37,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:05:37,080 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 05:05:37,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:05:37,088 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:05:37,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:05:37,088 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:05:37,089 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:05:37,089 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:05:37,089 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:05:37,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:05:37,089 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:05:37,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:05:37,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:05:37,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:05:37,090 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:05:37,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:05:37,090 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:05:37,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:05:37,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:05:37,091 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:05:37,091 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:05:37,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:05:37,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:05:37,091 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:05:37,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:05:37,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:05:37,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:05:37,092 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:05:37,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:05:37,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:05:37,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:05:37,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:05:37,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0a39eefaccc62f602b71ff7e91e6bcef4799631 [2018-12-02 05:05:37,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:05:37,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:05:37,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:05:37,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:05:37,120 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:05:37,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-12-02 05:05:37,157 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/data/fa76e2ad5/5b2b4d13a49442f682fdfb1dbc173333/FLAGc2cd4b629 [2018-12-02 05:05:37,587 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:05:37,587 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-12-02 05:05:37,590 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/data/fa76e2ad5/5b2b4d13a49442f682fdfb1dbc173333/FLAGc2cd4b629 [2018-12-02 05:05:37,598 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/data/fa76e2ad5/5b2b4d13a49442f682fdfb1dbc173333 [2018-12-02 05:05:37,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:05:37,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:05:37,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:05:37,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:05:37,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:05:37,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22096c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37, skipping insertion in model container [2018-12-02 05:05:37,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:05:37,618 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:05:37,707 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:05:37,711 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:05:37,721 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:05:37,729 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:05:37,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37 WrapperNode [2018-12-02 05:05:37,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:05:37,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:05:37,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:05:37,730 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:05:37,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:05:37,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:05:37,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:05:37,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:05:37,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... [2018-12-02 05:05:37,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:05:37,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:05:37,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:05:37,793 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:05:37,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/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 [2018-12-02 05:05:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 05:05:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-12-02 05:05:37,825 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-12-02 05:05:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:05:37,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:05:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:05:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:05:37,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:05:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:05:37,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:05:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 05:05:37,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 05:05:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:05:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:05:37,953 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:05:37,953 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 05:05:37,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:05:37 BoogieIcfgContainer [2018-12-02 05:05:37,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:05:37,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:05:37,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:05:37,957 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:05:37,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:05:37" (1/3) ... [2018-12-02 05:05:37,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e21cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:05:37, skipping insertion in model container [2018-12-02 05:05:37,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:05:37" (2/3) ... [2018-12-02 05:05:37,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e21cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:05:37, skipping insertion in model container [2018-12-02 05:05:37,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:05:37" (3/3) ... [2018-12-02 05:05:37,960 INFO L112 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init_true-unreach-call.i [2018-12-02 05:05:37,969 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:05:37,975 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 05:05:37,990 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 05:05:38,014 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:05:38,015 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:05:38,015 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:05:38,015 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:05:38,015 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:05:38,015 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:05:38,015 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:05:38,015 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:05:38,015 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:05:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-02 05:05:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 05:05:38,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:38,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:38,031 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:38,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash -850547107, now seen corresponding path program 1 times [2018-12-02 05:05:38,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:38,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:38,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:38,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:05:38,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:05:38,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:05:38,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 05:05:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 05:05:38,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 05:05:38,132 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-12-02 05:05:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:38,144 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-12-02 05:05:38,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 05:05:38,145 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-12-02 05:05:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:38,149 INFO L225 Difference]: With dead ends: 56 [2018-12-02 05:05:38,149 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 05:05:38,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 05:05:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 05:05:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 05:05:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 05:05:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-02 05:05:38,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2018-12-02 05:05:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:38,172 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-02 05:05:38,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 05:05:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-02 05:05:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 05:05:38,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:38,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:38,173 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:38,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1453375688, now seen corresponding path program 1 times [2018-12-02 05:05:38,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:38,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:05:38,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:05:38,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:05:38,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:05:38,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:05:38,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:05:38,216 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-12-02 05:05:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:38,238 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-12-02 05:05:38,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:05:38,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 05:05:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:38,240 INFO L225 Difference]: With dead ends: 48 [2018-12-02 05:05:38,240 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 05:05:38,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:05:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 05:05:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-12-02 05:05:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 05:05:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 05:05:38,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2018-12-02 05:05:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:38,247 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 05:05:38,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:05:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-02 05:05:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 05:05:38,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:38,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:38,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:38,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:38,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1976547036, now seen corresponding path program 1 times [2018-12-02 05:05:38,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:38,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:05:38,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:05:38,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:05:38,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:05:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:05:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:05:38,274 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-12-02 05:05:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:38,283 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-12-02 05:05:38,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:05:38,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 05:05:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:38,284 INFO L225 Difference]: With dead ends: 47 [2018-12-02 05:05:38,284 INFO L226 Difference]: Without dead ends: 29 [2018-12-02 05:05:38,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:05:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-02 05:05:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-02 05:05:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 05:05:38,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-02 05:05:38,287 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2018-12-02 05:05:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:38,287 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-02 05:05:38,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:05:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-02 05:05:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 05:05:38,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:38,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:38,288 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:38,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:38,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1583520026, now seen corresponding path program 1 times [2018-12-02 05:05:38,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:38,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:38,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:38,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:05:38,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:05:38,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:05:38,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:38,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:05:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:05:38,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:05:38,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-12-02 05:05:38,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:05:38,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:05:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:05:38,377 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2018-12-02 05:05:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:38,420 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-12-02 05:05:38,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:05:38,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-02 05:05:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:38,422 INFO L225 Difference]: With dead ends: 65 [2018-12-02 05:05:38,422 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 05:05:38,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:05:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 05:05:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2018-12-02 05:05:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 05:05:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-02 05:05:38,425 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 23 [2018-12-02 05:05:38,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:38,426 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-02 05:05:38,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:05:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-02 05:05:38,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 05:05:38,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:38,426 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:38,427 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:38,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:38,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1373480502, now seen corresponding path program 1 times [2018-12-02 05:05:38,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:38,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:38,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:38,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:05:38,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:05:38,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:05:38,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:38,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:05:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 05:05:38,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:05:38,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-02 05:05:38,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:05:38,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:05:38,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:05:38,532 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-12-02 05:05:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:38,581 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2018-12-02 05:05:38,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:05:38,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-02 05:05:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:38,582 INFO L225 Difference]: With dead ends: 78 [2018-12-02 05:05:38,582 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 05:05:38,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:05:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 05:05:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-12-02 05:05:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 05:05:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-02 05:05:38,586 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 28 [2018-12-02 05:05:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:38,586 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-02 05:05:38,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:05:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-02 05:05:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 05:05:38,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:38,587 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:38,587 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:38,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash 484904918, now seen corresponding path program 2 times [2018-12-02 05:05:38,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:38,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:38,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:38,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 05:05:38,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:05:38,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:05:38,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 05:05:38,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 05:05:38,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:05:38,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:05:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 05:05:38,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:05:38,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-02 05:05:38,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:05:38,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:05:38,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:05:38,717 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-12-02 05:05:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:38,784 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-12-02 05:05:38,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:05:38,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-12-02 05:05:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:38,784 INFO L225 Difference]: With dead ends: 91 [2018-12-02 05:05:38,785 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 05:05:38,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:05:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 05:05:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-12-02 05:05:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 05:05:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-02 05:05:38,789 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 33 [2018-12-02 05:05:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:38,789 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-02 05:05:38,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:05:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-02 05:05:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 05:05:38,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:38,789 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:38,790 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:38,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:38,790 INFO L82 PathProgramCache]: Analyzing trace with hash -913363186, now seen corresponding path program 3 times [2018-12-02 05:05:38,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:38,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:38,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:05:38,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 05:05:38,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:05:38,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:05:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:05:38,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 05:05:38,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:05:38,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:05:38,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 05:05:38,938 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:05:38,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:38,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:38,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 05:05:38,946 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:05:38,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:38,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:38,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:38,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-02 05:05:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 05:05:38,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:05:38,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-12-02 05:05:38,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 05:05:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 05:05:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:05:38,991 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 15 states. [2018-12-02 05:05:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:39,149 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2018-12-02 05:05:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:05:39,149 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-12-02 05:05:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:39,150 INFO L225 Difference]: With dead ends: 89 [2018-12-02 05:05:39,150 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 05:05:39,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:05:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 05:05:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2018-12-02 05:05:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 05:05:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-12-02 05:05:39,157 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 38 [2018-12-02 05:05:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:39,157 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-12-02 05:05:39,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 05:05:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-12-02 05:05:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 05:05:39,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:39,158 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:39,158 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:39,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:39,158 INFO L82 PathProgramCache]: Analyzing trace with hash -448891321, now seen corresponding path program 1 times [2018-12-02 05:05:39,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:39,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:39,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:05:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 05:05:39,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:05:39,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:05:39,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:05:39,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:05:39,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:05:39,195 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 3 states. [2018-12-02 05:05:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:39,200 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-02 05:05:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:05:39,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-02 05:05:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:39,202 INFO L225 Difference]: With dead ends: 64 [2018-12-02 05:05:39,203 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 05:05:39,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:05:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 05:05:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-02 05:05:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 05:05:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-12-02 05:05:39,208 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 44 [2018-12-02 05:05:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:39,208 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-12-02 05:05:39,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:05:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-12-02 05:05:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:05:39,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:39,209 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:39,210 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:39,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:39,210 INFO L82 PathProgramCache]: Analyzing trace with hash -828938698, now seen corresponding path program 1 times [2018-12-02 05:05:39,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:39,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:39,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:39,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:39,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 05:05:39,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:05:39,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:05:39,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:39,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:05:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 05:05:39,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:05:39,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-12-02 05:05:39,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:05:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:05:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:05:39,347 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 13 states. [2018-12-02 05:05:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:39,430 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-12-02 05:05:39,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:05:39,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-12-02 05:05:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:39,430 INFO L225 Difference]: With dead ends: 126 [2018-12-02 05:05:39,430 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 05:05:39,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:05:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 05:05:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58. [2018-12-02 05:05:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 05:05:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-02 05:05:39,436 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 50 [2018-12-02 05:05:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:39,436 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-02 05:05:39,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:05:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-02 05:05:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:05:39,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:39,437 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:39,437 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:39,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:39,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1725951930, now seen corresponding path program 2 times [2018-12-02 05:05:39,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:39,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:39,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:39,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:39,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 05:05:39,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:05:39,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:05:39,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 05:05:39,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 05:05:39,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:05:39,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:05:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-02 05:05:39,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:05:39,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-12-02 05:05:39,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 05:05:39,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 05:05:39,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:05:39,587 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 15 states. [2018-12-02 05:05:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:39,680 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-12-02 05:05:39,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:05:39,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-12-02 05:05:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:39,681 INFO L225 Difference]: With dead ends: 139 [2018-12-02 05:05:39,681 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 05:05:39,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:05:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 05:05:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2018-12-02 05:05:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 05:05:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-02 05:05:39,688 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 55 [2018-12-02 05:05:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:39,688 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-02 05:05:39,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 05:05:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-02 05:05:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 05:05:39,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:39,689 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:39,690 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:05:39,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1238942342, now seen corresponding path program 3 times [2018-12-02 05:05:39,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:39,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:39,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:05:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 05:05:39,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:05:39,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:05:39,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:05:39,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 05:05:39,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:05:39,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:05:39,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 05:05:39,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 05:05:39,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:39,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:39,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:39,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-12-02 05:05:39,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-12-02 05:05:39,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2018-12-02 05:05:39,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 05:05:39,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:05:39,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:05:39,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:20 [2018-12-02 05:05:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-02 05:05:39,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:05:39,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-12-02 05:05:39,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 05:05:39,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 05:05:39,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:05:39,978 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2018-12-02 05:05:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:40,240 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-12-02 05:05:40,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:05:40,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-12-02 05:05:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:40,241 INFO L225 Difference]: With dead ends: 70 [2018-12-02 05:05:40,241 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 05:05:40,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2018-12-02 05:05:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 05:05:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 05:05:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 05:05:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 05:05:40,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-12-02 05:05:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:40,243 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:05:40,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 05:05:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 05:05:40,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 05:05:40,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 05:05:40,389 INFO L451 ceAbstractionStarter]: At program point initENTRY(lines 9 16) the Hoare annotation is: true [2018-12-02 05:05:40,389 INFO L448 ceAbstractionStarter]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2018-12-02 05:05:40,389 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2018-12-02 05:05:40,389 INFO L444 ceAbstractionStarter]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and (exists ((v_init_~i~0_17 Int)) (and (<= init_~i~0 (+ v_init_~i~0_17 1)) (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* 4 v_init_~i~0_17))) 0)) (< v_init_~i~0_17 init_~size))) .cse0 .cse1 .cse2) (and (<= init_~i~0 0) .cse0 .cse1 .cse2))) [2018-12-02 05:05:40,389 INFO L448 ceAbstractionStarter]: For program point L12-4(lines 9 16) no Hoare annotation was computed. [2018-12-02 05:05:40,389 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 05:05:40,389 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-02 05:05:40,389 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 05:05:40,390 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L444 ceAbstractionStarter]: At program point L31-3(lines 31 35) the Hoare annotation is: (= main_~flag~0 1) [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= main_~flag~0 0) (= |main_~#a~0.offset| 0)) [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L444 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: false [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 17 37) the Hoare annotation is: true [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2018-12-02 05:05:40,390 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2018-12-02 05:05:40,391 INFO L444 ceAbstractionStarter]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (exists ((v_init_~i~0_17 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_17) |main_~#a~0.offset|)) 0)) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))) (.cse1 (= main_~flag~0 0)) (.cse2 (= |main_~#a~0.offset| 0))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~i~1 99999) .cse0 .cse1 (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) 0) .cse2) (and .cse0 .cse1 (= main_~i~1 0) .cse2) (= main_~flag~0 1))) [2018-12-02 05:05:40,391 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2018-12-02 05:05:40,391 INFO L448 ceAbstractionStarter]: For program point L4-3(line 4) no Hoare annotation was computed. [2018-12-02 05:05:40,391 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2018-12-02 05:05:40,391 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2018-12-02 05:05:40,391 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-12-02 05:05:40,391 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-12-02 05:05:40,391 INFO L448 ceAbstractionStarter]: For program point L4-1(line 4) no Hoare annotation was computed. [2018-12-02 05:05:40,398 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 05:05:40,399 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 05:05:40,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,404 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,405 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:05:40 BoogieIcfgContainer [2018-12-02 05:05:40,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:05:40,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:05:40,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:05:40,407 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:05:40,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:05:37" (3/4) ... [2018-12-02 05:05:40,409 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 05:05:40,413 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-12-02 05:05:40,414 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 05:05:40,414 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 05:05:40,414 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 05:05:40,416 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-02 05:05:40,417 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 05:05:40,417 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 05:05:40,433 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == #memory_$Pointer$[a][a] && i <= 99999) && (\exists v_init_~i~0_17 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_17 + a] == 0) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == 0) || ((((\exists v_init_~i~0_17 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_17 + a] == 0) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000) && flag == 0) && i == 0) && a == 0)) || flag == 1 [2018-12-02 05:05:40,433 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_init_~i~0_17 : int :: (i <= v_init_~i~0_17 + 1 && !(#memory_$Pointer$[a][a + 4 * v_init_~i~0_17] == 0)) && v_init_~i~0_17 < size) && a == a) && \old(size) == size) && a == a) || (((i <= 0 && a == a) && \old(size) == size) && a == a) [2018-12-02 05:05:40,441 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fd2665fd-ea89-4c56-95d1-fa74a97f196d/bin-2019/uautomizer/witness.graphml [2018-12-02 05:05:40,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:05:40,442 INFO L168 Benchmark]: Toolchain (without parser) took 2841.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 962.4 MB in the beginning and 979.3 MB in the end (delta: -16.9 MB). Peak memory consumption was 200.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:05:40,442 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:05:40,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.76 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:05:40,443 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.93 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:05:40,443 INFO L168 Benchmark]: Boogie Preprocessor took 48.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:05:40,443 INFO L168 Benchmark]: RCFGBuilder took 161.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:05:40,443 INFO L168 Benchmark]: TraceAbstraction took 2451.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 987.2 MB in the end (delta: 120.1 MB). Peak memory consumption was 202.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:05:40,444 INFO L168 Benchmark]: Witness Printer took 34.60 ms. Allocated memory is still 1.2 GB. Free memory was 987.2 MB in the beginning and 979.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:05:40,445 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 128.76 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.93 ms. Allocated memory is still 1.0 GB. Free memory is still 951.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 161.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2451.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 987.2 MB in the end (delta: 120.1 MB). Peak memory consumption was 202.9 MB. Max. memory is 11.5 GB. * Witness Printer took 34.60 ms. Allocated memory is still 1.2 GB. Free memory was 987.2 MB in the beginning and 979.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 24]: Loop Invariant [2018-12-02 05:05:40,448 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 05:05:40,448 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,449 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,449 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,450 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 05:05:40,450 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,450 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,450 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((0 == #memory_$Pointer$[a][a] && i <= 99999) && (\exists v_init_~i~0_17 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_17 + a] == 0) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == 0) || ((((\exists v_init_~i~0_17 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_17 + a] == 0) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000) && flag == 0) && i == 0) && a == 0)) || flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2018-12-02 05:05:40,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,451 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,452 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 05:05:40,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,452 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 05:05:40,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2018-12-02 05:05:40,453 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((\exists v_init_~i~0_17 : int :: (i <= v_init_~i~0_17 + 1 && !(#memory_$Pointer$[a][a + 4 * v_init_~i~0_17] == 0)) && v_init_~i~0_17 < size) && a == a) && \old(size) == size) && a == a) || (((i <= 0 && a == a) && \old(size) == size) && a == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 302 SDtfs, 263 SDslu, 1149 SDs, 0 SdLazy, 685 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 150 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 24 PreInvPairs, 41 NumberOfFragments, 141 HoareAnnotationTreeSize, 24 FomulaSimplifications, 152 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 355 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 681 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 663 ConstructedInterpolants, 23 QuantifiedInterpolants, 89083 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1044 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 336/597 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...