./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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 ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:56:04,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:56:04,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:56:04,444 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:56:04,444 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:56:04,445 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:56:04,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:56:04,447 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:56:04,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:56:04,448 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:56:04,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:56:04,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:56:04,450 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:56:04,450 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:56:04,450 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:56:04,451 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:56:04,451 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:56:04,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:56:04,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:56:04,454 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:56:04,455 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:56:04,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:56:04,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:56:04,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:56:04,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:56:04,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:56:04,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:56:04,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:56:04,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:56:04,459 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:56:04,459 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:56:04,460 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:56:04,460 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:56:04,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:56:04,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:56:04,461 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:56:04,461 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:56:04,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:56:04,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:56:04,469 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:56:04,469 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:56:04,470 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:56:04,470 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:56:04,470 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:56:04,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:56:04,471 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:56:04,471 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:56:04,471 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:56:04,471 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:56:04,471 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:56:04,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:56:04,471 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:56:04,472 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:56:04,472 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:56:04,472 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:56:04,472 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:56:04,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:56:04,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:56:04,473 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:56:04,473 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:56:04,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:56:04,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:56:04,473 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:56:04,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:56:04,473 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:56:04,474 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:56:04,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:56:04,474 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_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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 -> ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 [2018-11-28 11:56:04,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:56:04,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:56:04,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:56:04,511 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:56:04,512 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:56:04,512 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-28 11:56:04,558 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/data/051be7991/e1929945d0884f958054b2aa9e55595a/FLAGea3c4c99c [2018-11-28 11:56:04,949 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:56:04,949 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/sv-benchmarks/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-28 11:56:04,953 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/data/051be7991/e1929945d0884f958054b2aa9e55595a/FLAGea3c4c99c [2018-11-28 11:56:04,962 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/data/051be7991/e1929945d0884f958054b2aa9e55595a [2018-11-28 11:56:04,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:56:04,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:56:04,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:56:04,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:56:04,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:56:04,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:56:04" (1/1) ... [2018-11-28 11:56:04,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a3ea0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:04, skipping insertion in model container [2018-11-28 11:56:04,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:56:04" (1/1) ... [2018-11-28 11:56:04,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:56:04,984 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:56:05,084 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:56:05,090 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:56:05,102 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:56:05,111 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:56:05,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05 WrapperNode [2018-11-28 11:56:05,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:56:05,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:56:05,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:56:05,112 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:56:05,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2018-11-28 11:56:05,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2018-11-28 11:56:05,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:56:05,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:56:05,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:56:05,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:56:05,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2018-11-28 11:56:05,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2018-11-28 11:56:05,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2018-11-28 11:56:05,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2018-11-28 11:56:05,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2018-11-28 11:56:05,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2018-11-28 11:56:05,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2018-11-28 11:56:05,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:56:05,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:56:05,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:56:05,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:56:05,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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-11-28 11:56:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:56:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:56:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:56:05,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:56:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:56:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:56:05,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:56:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:56:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:56:05,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:56:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-28 11:56:05,229 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-28 11:56:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:56:05,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:56:05,431 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:56:05,432 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 11:56:05,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:05 BoogieIcfgContainer [2018-11-28 11:56:05,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:56:05,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:56:05,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:56:05,435 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:56:05,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:56:04" (1/3) ... [2018-11-28 11:56:05,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd86ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:56:05, skipping insertion in model container [2018-11-28 11:56:05,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (2/3) ... [2018-11-28 11:56:05,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd86ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:56:05, skipping insertion in model container [2018-11-28 11:56:05,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:05" (3/3) ... [2018-11-28 11:56:05,438 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2018-11-28 11:56:05,447 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:56:05,453 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:56:05,468 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:56:05,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:56:05,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:56:05,494 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:56:05,494 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:56:05,494 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:56:05,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:56:05,495 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:56:05,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:56:05,495 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:56:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-28 11:56:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 11:56:05,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:05,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:05,520 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:05,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:05,524 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-11-28 11:56:05,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:05,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:05,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:05,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:05,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:56:05,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:56:05,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:56:05,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 11:56:05,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:56:05,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:56:05,655 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-28 11:56:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:05,671 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-28 11:56:05,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:56:05,673 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-28 11:56:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:05,681 INFO L225 Difference]: With dead ends: 42 [2018-11-28 11:56:05,681 INFO L226 Difference]: Without dead ends: 20 [2018-11-28 11:56:05,684 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-11-28 11:56:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-28 11:56:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 11:56:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 11:56:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-28 11:56:05,714 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-28 11:56:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:05,715 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-28 11:56:05,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 11:56:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-28 11:56:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 11:56:05,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:05,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:05,716 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:05,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:05,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-11-28 11:56:05,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:05,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:05,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:56:05,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:56:05,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:56:05,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:56:05,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:56:05,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:56:05,768 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-28 11:56:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:05,789 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-28 11:56:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:56:05,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 11:56:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:05,791 INFO L225 Difference]: With dead ends: 34 [2018-11-28 11:56:05,791 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 11:56:05,791 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-11-28 11:56:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 11:56:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 11:56:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 11:56:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 11:56:05,796 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-28 11:56:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:05,796 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 11:56:05,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:56:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-28 11:56:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:56:05,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:05,798 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-11-28 11:56:05,798 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:05,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:05,799 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-11-28 11:56:05,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:05,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:05,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:05,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:05,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:56:05,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:05,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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-11-28 11:56:05,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:05,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:56:05,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:05,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 11:56:05,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:56:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:56:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:56:05,925 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-28 11:56:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:05,944 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-28 11:56:05,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:56:05,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 11:56:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:05,945 INFO L225 Difference]: With dead ends: 36 [2018-11-28 11:56:05,945 INFO L226 Difference]: Without dead ends: 24 [2018-11-28 11:56:05,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:56:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-28 11:56:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-28 11:56:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 11:56:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-28 11:56:05,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-28 11:56:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:05,949 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-28 11:56:05,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:56:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-28 11:56:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:56:05,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:05,950 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:05,950 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:05,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:05,950 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-11-28 11:56:05,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:05,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:05,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:05,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:05,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:56:06,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:06,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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-11-28 11:56:06,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:56:06,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 11:56:06,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:56:06,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:06,098 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 17 treesize of output 13 [2018-11-28 11:56:06,101 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:56:06,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:56:06,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:06,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:06,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-28 11:56:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:56:06,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:56:06,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-28 11:56:06,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:56:06,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:56:06,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:56:06,158 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2018-11-28 11:56:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:06,236 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-28 11:56:06,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:56:06,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-28 11:56:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:06,237 INFO L225 Difference]: With dead ends: 40 [2018-11-28 11:56:06,237 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 11:56:06,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:56:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 11:56:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-28 11:56:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 11:56:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-28 11:56:06,240 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-11-28 11:56:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:06,240 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-28 11:56:06,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:56:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-28 11:56:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:56:06,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:06,240 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:06,240 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:06,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 1 times [2018-11-28 11:56:06,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:06,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:06,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:06,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:56:06,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:56:06,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:06,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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-11-28 11:56:06,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:06,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:56:06,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:06,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 11:56:06,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:56:06,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:56:06,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:56:06,393 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-11-28 11:56:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:06,417 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-28 11:56:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:56:06,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-28 11:56:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:06,419 INFO L225 Difference]: With dead ends: 44 [2018-11-28 11:56:06,419 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 11:56:06,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:56:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 11:56:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-28 11:56:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 11:56:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-28 11:56:06,423 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-28 11:56:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:06,423 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-28 11:56:06,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:56:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-28 11:56:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:56:06,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:06,424 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:06,424 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:06,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:06,425 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 2 times [2018-11-28 11:56:06,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:06,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:06,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:56:06,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:06,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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-11-28 11:56:06,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:56:06,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:56:06,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:56:06,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:56:06,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:06,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 11:56:06,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:56:06,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:56:06,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:56:06,576 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2018-11-28 11:56:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:06,623 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-28 11:56:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:56:06,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-28 11:56:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:06,624 INFO L225 Difference]: With dead ends: 46 [2018-11-28 11:56:06,625 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 11:56:06,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:56:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 11:56:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-28 11:56:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 11:56:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-28 11:56:06,629 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-28 11:56:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:06,630 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-28 11:56:06,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:56:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-28 11:56:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:56:06,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:06,631 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:06,631 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:06,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash 814278768, now seen corresponding path program 3 times [2018-11-28 11:56:06,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:06,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:06,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:06,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:56:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:56:06,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:06,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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-11-28 11:56:06,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:56:06,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 11:56:06,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:56:06,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:06,825 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 17 treesize of output 13 [2018-11-28 11:56:06,828 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:56:06,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:56:06,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:06,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:06,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-28 11:56:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 11:56:06,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:06,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-28 11:56:06,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:56:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:56:06,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:56:06,878 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-11-28 11:56:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:06,955 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-28 11:56:06,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:56:06,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-28 11:56:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:06,956 INFO L225 Difference]: With dead ends: 50 [2018-11-28 11:56:06,956 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 11:56:06,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:56:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 11:56:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-28 11:56:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 11:56:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-28 11:56:06,959 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-11-28 11:56:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:06,959 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-28 11:56:06,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:56:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-28 11:56:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 11:56:06,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:06,960 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:06,961 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:06,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:06,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1119042125, now seen corresponding path program 4 times [2018-11-28 11:56:06,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:06,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:06,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:06,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:56:06,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 11:56:07,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:07,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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-11-28 11:56:07,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:56:07,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:56:07,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:56:07,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:07,132 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 17 treesize of output 13 [2018-11-28 11:56:07,135 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:56:07,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:56:07,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:07,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:07,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-28 11:56:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-28 11:56:07,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:07,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-28 11:56:07,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:56:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:56:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:56:07,172 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2018-11-28 11:56:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:07,246 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-28 11:56:07,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 11:56:07,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-28 11:56:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:07,247 INFO L225 Difference]: With dead ends: 56 [2018-11-28 11:56:07,247 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 11:56:07,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:56:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 11:56:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-28 11:56:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 11:56:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-28 11:56:07,251 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-11-28 11:56:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:07,251 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-28 11:56:07,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:56:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-28 11:56:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 11:56:07,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:07,252 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:07,252 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:07,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:07,252 INFO L82 PathProgramCache]: Analyzing trace with hash -820541462, now seen corresponding path program 5 times [2018-11-28 11:56:07,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:07,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:07,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:56:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:56:07,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:07,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/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-11-28 11:56:07,338 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:56:08,888 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-28 11:56:08,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:56:08,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:56:08,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:08,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-28 11:56:08,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:56:08,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:56:08,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:56:08,923 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-11-28 11:56:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:08,950 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-28 11:56:08,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:56:08,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-28 11:56:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:08,951 INFO L225 Difference]: With dead ends: 60 [2018-11-28 11:56:08,951 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 11:56:08,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:56:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 11:56:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-28 11:56:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 11:56:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-28 11:56:08,954 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-11-28 11:56:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:08,954 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-28 11:56:08,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:56:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-28 11:56:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 11:56:08,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:08,955 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:08,955 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:08,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash 478163660, now seen corresponding path program 6 times [2018-11-28 11:56:08,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:08,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:08,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:08,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:56:08,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:56:09,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:09,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:56:09,084 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 11:56:09,672 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 11:56:09,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:56:09,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:09,724 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 17 treesize of output 13 [2018-11-28 11:56:09,725 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:56:09,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:56:09,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:09,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:09,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-28 11:56:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 11:56:09,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:09,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-11-28 11:56:09,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 11:56:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:56:09,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:56:09,755 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 17 states. [2018-11-28 11:56:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:09,843 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-28 11:56:09,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:56:09,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-28 11:56:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:09,844 INFO L225 Difference]: With dead ends: 64 [2018-11-28 11:56:09,844 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 11:56:09,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:56:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 11:56:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-28 11:56:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 11:56:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-28 11:56:09,847 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2018-11-28 11:56:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:09,847 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-28 11:56:09,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 11:56:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-28 11:56:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 11:56:09,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:09,848 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:09,848 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:09,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:09,848 INFO L82 PathProgramCache]: Analyzing trace with hash -956118231, now seen corresponding path program 7 times [2018-11-28 11:56:09,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:09,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:09,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:09,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:56:09,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 11:56:09,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:09,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:56:09,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:09,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 11:56:10,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:10,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-28 11:56:10,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:56:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:56:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:56:10,008 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 13 states. [2018-11-28 11:56:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:10,040 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-28 11:56:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:56:10,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-28 11:56:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:10,046 INFO L225 Difference]: With dead ends: 67 [2018-11-28 11:56:10,046 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 11:56:10,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:56:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 11:56:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-28 11:56:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 11:56:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-28 11:56:10,050 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-11-28 11:56:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:10,050 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-28 11:56:10,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:56:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-28 11:56:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 11:56:10,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:10,051 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:10,051 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:10,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:10,051 INFO L82 PathProgramCache]: Analyzing trace with hash -50051957, now seen corresponding path program 8 times [2018-11-28 11:56:10,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:10,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:10,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:10,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:10,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-28 11:56:10,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:10,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:56:10,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:56:10,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:56:10,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:56:10,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:11,026 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 25 treesize of output 21 [2018-11-28 11:56:11,029 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-28 11:56:11,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:56:11,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:11,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:11,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-11-28 11:56:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:56:11,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:11,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 26 [2018-11-28 11:56:11,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 11:56:11,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 11:56:11,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2018-11-28 11:56:11,052 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 26 states. [2018-11-28 11:56:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:11,455 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-28 11:56:11,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 11:56:11,455 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-11-28 11:56:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:11,456 INFO L225 Difference]: With dead ends: 57 [2018-11-28 11:56:11,456 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 11:56:11,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 11:56:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 11:56:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-28 11:56:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 11:56:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-28 11:56:11,462 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-11-28 11:56:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:11,463 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-28 11:56:11,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 11:56:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-28 11:56:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:56:11,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:11,464 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:11,464 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:11,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash -715849914, now seen corresponding path program 9 times [2018-11-28 11:56:11,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:11,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:56:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 11:56:12,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:12,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:56:12,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:56:12,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 11:56:12,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:56:12,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:12,697 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-11-28 11:56:12,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 11:56:12,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:56:12,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:12,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:12,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12 [2018-11-28 11:56:12,761 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 17 treesize of output 13 [2018-11-28 11:56:12,763 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:56:12,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:56:12,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:12,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:56:12,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-28 11:56:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-28 11:56:12,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:12,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 21 [2018-11-28 11:56:12,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 11:56:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:56:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:56:12,798 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2018-11-28 11:56:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:13,014 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-28 11:56:13,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 11:56:13,015 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-11-28 11:56:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:13,015 INFO L225 Difference]: With dead ends: 67 [2018-11-28 11:56:13,015 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 11:56:13,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=504, Invalid=1218, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 11:56:13,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 11:56:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-28 11:56:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-28 11:56:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-28 11:56:13,019 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 48 [2018-11-28 11:56:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:13,020 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-28 11:56:13,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 11:56:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-28 11:56:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 11:56:13,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:13,021 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:13,021 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:13,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash -875693139, now seen corresponding path program 10 times [2018-11-28 11:56:13,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:13,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:13,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:13,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:56:13,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:56:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:56:13,163 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:56:13,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:56:13 BoogieIcfgContainer [2018-11-28 11:56:13,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:56:13,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:56:13,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:56:13,200 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:56:13,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:05" (3/4) ... [2018-11-28 11:56:13,203 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:56:13,251 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_61b5e9c9-1064-4e86-90f5-2532d001ea6e/bin-2019/uautomizer/witness.graphml [2018-11-28 11:56:13,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:56:13,252 INFO L168 Benchmark]: Toolchain (without parser) took 8287.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 952.2 MB in the beginning and 907.3 MB in the end (delta: 44.9 MB). Peak memory consumption was 355.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:56:13,253 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:56:13,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.83 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:56:13,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:56:13,254 INFO L168 Benchmark]: Boogie Preprocessor took 21.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:56:13,254 INFO L168 Benchmark]: RCFGBuilder took 244.74 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.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:56:13,254 INFO L168 Benchmark]: TraceAbstraction took 7767.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 1.1 GB in the beginning and 914.3 MB in the end (delta: 216.2 MB). Peak memory consumption was 374.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:56:13,255 INFO L168 Benchmark]: Witness Printer took 51.65 ms. Allocated memory is still 1.3 GB. Free memory was 914.3 MB in the beginning and 907.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:56:13,256 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.83 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 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 53.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 244.74 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.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7767.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 1.1 GB in the beginning and 914.3 MB in the end (delta: 216.2 MB). Peak memory consumption was 374.0 MB. Max. memory is 11.5 GB. * Witness Printer took 51.65 ms. Allocated memory is still 1.3 GB. Free memory was 914.3 MB in the beginning and 907.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 45]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={106:0}, cont={122:0}, i=0, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=0, j=10] [L24] COND FALSE !(j < 10) VAL [array={106:0}, cont={122:0}, i=0, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={106:0}, cont={122:0}, cont.array={106:0}, cont.array[0].b=5, i=0, j=10, pa={106:4}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-5, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-4, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-4, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-3, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-3, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-2, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-2, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-1, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=-1, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=0, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=0, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=1, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=2, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=2, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=3, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=3, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=4, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=4, j=10, pa={106:4}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=5, j=10, pa={106:4}] [L34] EXPR \read(*pa) VAL [\read(*pa)=5, array={106:0}, cont={122:0}, i=5, j=10, pa={106:4}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=5, pc={122:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={106:0}, check(&cont, i)=0, cont={122:0}, i=5, j=10, pa={106:4}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={106:0}, cont={122:0}, i=5, j=10, pa={106:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 7.7s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 237 SDtfs, 124 SDslu, 1026 SDs, 0 SdLazy, 817 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 363 SyntacticMatches, 10 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=13, 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, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 845 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 763 ConstructedInterpolants, 9 QuantifiedInterpolants, 78041 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1701 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 386/1182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...