./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.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_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/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 308e43cca528a064aecd41d099b341627e43bb71 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:56:27,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:56:27,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:56:27,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:56:27,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:56:27,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:56:27,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:56:27,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:56:27,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:56:27,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:56:27,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:56:27,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:56:27,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:56:27,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:56:27,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:56:27,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:56:27,277 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:56:27,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:56:27,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:56:27,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:56:27,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:56:27,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:56:27,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:56:27,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:56:27,286 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:56:27,287 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:56:27,288 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:56:27,289 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:56:27,289 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:56:27,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:56:27,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:56:27,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:56:27,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:56:27,291 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:56:27,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:56:27,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:56:27,293 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:56:27,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:56:27,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:56:27,303 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:56:27,303 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:56:27,304 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:56:27,304 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:56:27,304 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:56:27,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:56:27,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:56:27,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:56:27,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:56:27,305 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:56:27,305 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:56:27,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:56:27,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:56:27,305 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:56:27,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:56:27,305 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:56:27,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:56:27,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:56:27,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:56:27,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:56:27,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:56:27,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:56:27,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:56:27,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:56:27,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:56:27,306 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:56:27,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:56:27,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:56:27,306 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_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/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 -> 308e43cca528a064aecd41d099b341627e43bb71 [2018-11-28 12:56:27,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:56:27,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:56:27,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:56:27,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:56:27,346 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:56:27,347 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-28 12:56:27,400 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/data/5b19ba949/3fd4733d61054a2baf09c0b978e54e14/FLAGa06f339d0 [2018-11-28 12:56:27,759 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:56:27,759 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-28 12:56:27,763 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/data/5b19ba949/3fd4733d61054a2baf09c0b978e54e14/FLAGa06f339d0 [2018-11-28 12:56:28,167 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/data/5b19ba949/3fd4733d61054a2baf09c0b978e54e14 [2018-11-28 12:56:28,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:56:28,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:56:28,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:56:28,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:56:28,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:56:28,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9df4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28, skipping insertion in model container [2018-11-28 12:56:28,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:56:28,200 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:56:28,320 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:56:28,331 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:56:28,345 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:56:28,360 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:56:28,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28 WrapperNode [2018-11-28 12:56:28,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:56:28,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:56:28,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:56:28,361 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:56:28,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:56:28,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:56:28,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:56:28,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:56:28,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... [2018-11-28 12:56:28,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:56:28,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:56:28,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:56:28,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:56:28,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/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 12:56:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-28 12:56:28,506 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-28 12:56:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:56:28,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:56:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 12:56:28,506 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-28 12:56:28,506 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-28 12:56:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:56:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:56:28,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:56:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:56:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-28 12:56:28,507 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-28 12:56:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:56:28,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:56:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:56:28,758 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:56:28,759 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:56:28,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:56:28 BoogieIcfgContainer [2018-11-28 12:56:28,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:56:28,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:56:28,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:56:28,762 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:56:28,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:56:28" (1/3) ... [2018-11-28 12:56:28,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6277cab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:56:28, skipping insertion in model container [2018-11-28 12:56:28,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:56:28" (2/3) ... [2018-11-28 12:56:28,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6277cab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:56:28, skipping insertion in model container [2018-11-28 12:56:28,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:56:28" (3/3) ... [2018-11-28 12:56:28,766 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-11-28 12:56:28,776 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:56:28,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:56:28,804 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:56:28,835 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:56:28,835 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:56:28,835 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:56:28,836 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:56:28,836 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:56:28,836 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:56:28,836 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:56:28,836 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:56:28,836 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:56:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-28 12:56:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:56:28,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:56:28,859 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:28,861 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:56:28,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:28,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1787337799, now seen corresponding path program 1 times [2018-11-28 12:56:28,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:28,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:28,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:29,035 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 12:56:29,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:56:29,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:56:29,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 12:56:29,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:56:29,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:56:29,052 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-28 12:56:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:29,069 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-28 12:56:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:56:29,070 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-28 12:56:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:56:29,076 INFO L225 Difference]: With dead ends: 46 [2018-11-28 12:56:29,077 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 12:56:29,080 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 12:56:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 12:56:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 12:56:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 12:56:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-28 12:56:29,111 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2018-11-28 12:56:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:56:29,112 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-28 12:56:29,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 12:56:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-28 12:56:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:56:29,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:56:29,115 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:29,115 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:56:29,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1425990092, now seen corresponding path program 1 times [2018-11-28 12:56:29,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:29,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:29,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:29,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:29,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:29,924 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 27 [2018-11-28 12:56:29,996 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 12:56:29,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:56:29,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:56:29,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:56:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:56:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:56:30,000 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-11-28 12:56:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:30,494 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-28 12:56:30,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:56:30,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-28 12:56:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:56:30,497 INFO L225 Difference]: With dead ends: 54 [2018-11-28 12:56:30,498 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 12:56:30,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:56:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 12:56:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-11-28 12:56:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 12:56:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-28 12:56:30,514 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2018-11-28 12:56:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:56:30,515 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-28 12:56:30,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:56:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-28 12:56:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:56:30,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:56:30,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:30,517 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:56:30,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:30,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1848691918, now seen corresponding path program 1 times [2018-11-28 12:56:30,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:30,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:30,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:30,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:30,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:56:30,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:56:30,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/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 12:56:30,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:30,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:30,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 12:56:30,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-28 12:56:30,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:56:30,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:30,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:30,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-28 12:56:30,760 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 12:56:30,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:56:30,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-28 12:56:30,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:56:30,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:56:30,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:56:30,780 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2018-11-28 12:56:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:30,981 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-28 12:56:30,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:56:30,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-28 12:56:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:56:30,984 INFO L225 Difference]: With dead ends: 56 [2018-11-28 12:56:30,984 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 12:56:30,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:56:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 12:56:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-28 12:56:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 12:56:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-28 12:56:30,992 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-11-28 12:56:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:56:30,993 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 12:56:30,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:56:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-28 12:56:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:56:30,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:56:30,994 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:30,994 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:56:30,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash 568828240, now seen corresponding path program 1 times [2018-11-28 12:56:30,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:30,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:30,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:31,636 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 31 [2018-11-28 12:56:31,684 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 12:56:31,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:56:31,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:56:31,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:56:31,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:56:31,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:56:31,685 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2018-11-28 12:56:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:32,088 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-28 12:56:32,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:56:32,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-28 12:56:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:56:32,089 INFO L225 Difference]: With dead ends: 54 [2018-11-28 12:56:32,089 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 12:56:32,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:56:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 12:56:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-28 12:56:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 12:56:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-28 12:56:32,096 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2018-11-28 12:56:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:56:32,096 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-28 12:56:32,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:56:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-28 12:56:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:56:32,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:56:32,097 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:32,098 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:56:32,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:32,098 INFO L82 PathProgramCache]: Analyzing trace with hash -957154489, now seen corresponding path program 1 times [2018-11-28 12:56:32,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:32,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:32,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:32,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:32,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:32,563 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 37 [2018-11-28 12:56:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:56:32,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:56:32,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/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 12:56:32,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:32,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:32,981 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 16 treesize of output 13 [2018-11-28 12:56:32,983 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 13 treesize of output 12 [2018-11-28 12:56:32,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:56:32,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:32,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:56:32,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-28 12:56:33,076 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 38 treesize of output 32 [2018-11-28 12:56:33,080 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:56:33,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 12:56:33,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:56:33,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:33,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:33,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-28 12:56:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:56:33,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:56:33,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-28 12:56:33,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 12:56:33,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 12:56:33,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-11-28 12:56:33,150 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 23 states. [2018-11-28 12:56:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:33,862 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-28 12:56:33,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 12:56:33,863 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-28 12:56:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:56:33,863 INFO L225 Difference]: With dead ends: 60 [2018-11-28 12:56:33,863 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 12:56:33,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=1125, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 12:56:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 12:56:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2018-11-28 12:56:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 12:56:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 12:56:33,871 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2018-11-28 12:56:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:56:33,871 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 12:56:33,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 12:56:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 12:56:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:56:33,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:56:33,873 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:33,873 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:56:33,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:33,873 INFO L82 PathProgramCache]: Analyzing trace with hash -55973429, now seen corresponding path program 1 times [2018-11-28 12:56:33,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:33,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:33,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:33,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:34,365 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 30 [2018-11-28 12:56:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:56:34,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:56:34,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/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 12:56:34,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:34,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:34,820 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 16 treesize of output 13 [2018-11-28 12:56:34,823 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 13 treesize of output 12 [2018-11-28 12:56:34,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:56:34,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:34,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:56:34,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-11-28 12:56:34,909 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 34 treesize of output 28 [2018-11-28 12:56:34,912 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:56:34,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-28 12:56:34,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:56:34,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:34,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:34,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:5 [2018-11-28 12:56:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:56:34,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:56:34,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-28 12:56:34,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 12:56:34,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 12:56:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-11-28 12:56:34,965 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 23 states. [2018-11-28 12:56:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:35,776 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-28 12:56:35,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 12:56:35,777 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-28 12:56:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:56:35,778 INFO L225 Difference]: With dead ends: 62 [2018-11-28 12:56:35,778 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 12:56:35,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=1125, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 12:56:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 12:56:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-28 12:56:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 12:56:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 12:56:35,788 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2018-11-28 12:56:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:56:35,788 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 12:56:35,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 12:56:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 12:56:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 12:56:35,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:56:35,789 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:35,789 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:56:35,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1263240701, now seen corresponding path program 2 times [2018-11-28 12:56:35,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:35,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:35,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:35,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:35,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:36,344 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 44 [2018-11-28 12:56:36,777 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2018-11-28 12:56:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:56:37,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:56:37,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/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 12:56:37,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:56:37,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:56:37,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:56:37,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:37,228 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 16 treesize of output 13 [2018-11-28 12:56:37,230 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 13 treesize of output 12 [2018-11-28 12:56:37,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:56:37,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:37,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:56:37,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-11-28 12:56:37,418 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 39 treesize of output 33 [2018-11-28 12:56:37,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-11-28 12:56:37,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:56:37,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:37,428 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 12:56:37,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:9 [2018-11-28 12:56:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:56:37,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:56:37,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12] total 32 [2018-11-28 12:56:37,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-28 12:56:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 12:56:37,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2018-11-28 12:56:37,477 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 32 states. [2018-11-28 12:56:38,253 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-11-28 12:56:38,936 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2018-11-28 12:56:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:39,982 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-11-28 12:56:39,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-28 12:56:39,983 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2018-11-28 12:56:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:56:39,983 INFO L225 Difference]: With dead ends: 84 [2018-11-28 12:56:39,983 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 12:56:39,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=643, Invalid=3389, Unknown=0, NotChecked=0, Total=4032 [2018-11-28 12:56:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 12:56:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-28 12:56:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 12:56:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-28 12:56:40,000 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 37 [2018-11-28 12:56:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:56:40,000 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-28 12:56:40,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-28 12:56:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-28 12:56:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 12:56:40,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:56:40,002 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:40,002 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:56:40,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:40,002 INFO L82 PathProgramCache]: Analyzing trace with hash -685796735, now seen corresponding path program 2 times [2018-11-28 12:56:40,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:40,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:40,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:40,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:40,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:40,400 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 39 [2018-11-28 12:56:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:56:40,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:56:40,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/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 12:56:40,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:56:40,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:56:40,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:56:40,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:41,024 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 11 treesize of output 8 [2018-11-28 12:56:41,026 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 8 treesize of output 7 [2018-11-28 12:56:41,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:56:41,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:41,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:41,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-11-28 12:56:41,123 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 39 treesize of output 31 [2018-11-28 12:56:41,125 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 31 treesize of output 23 [2018-11-28 12:56:41,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:56:41,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:56:41,135 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 12:56:41,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:5 [2018-11-28 12:56:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:56:41,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:56:41,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2018-11-28 12:56:41,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 12:56:41,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 12:56:41,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-11-28 12:56:41,175 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 26 states. [2018-11-28 12:56:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:43,181 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-28 12:56:43,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 12:56:43,181 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-11-28 12:56:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:56:43,182 INFO L225 Difference]: With dead ends: 101 [2018-11-28 12:56:43,182 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 12:56:43,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=734, Invalid=3172, Unknown=0, NotChecked=0, Total=3906 [2018-11-28 12:56:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 12:56:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 47. [2018-11-28 12:56:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 12:56:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-28 12:56:43,197 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2018-11-28 12:56:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:56:43,197 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-28 12:56:43,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 12:56:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-28 12:56:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 12:56:43,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:56:43,198 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:43,198 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:56:43,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:43,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2133408361, now seen corresponding path program 3 times [2018-11-28 12:56:43,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:43,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:43,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:43,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:43,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:44,096 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 29 [2018-11-28 12:56:44,250 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 39 [2018-11-28 12:56:44,407 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 43 [2018-11-28 12:56:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:56:45,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:56:45,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/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 12:56:45,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:56:45,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 12:56:45,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:56:45,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:45,270 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 16 treesize of output 13 [2018-11-28 12:56:45,272 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 13 treesize of output 12 [2018-11-28 12:56:45,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:56:45,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:56:45,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:56:45,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-11-28 12:56:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-28 12:56:50,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:56:50,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2018-11-28 12:56:50,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 12:56:50,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 12:56:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1238, Unknown=2, NotChecked=0, Total=1332 [2018-11-28 12:56:50,162 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 37 states. [2018-11-28 12:56:59,153 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 62 [2018-11-28 12:56:59,339 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 57 [2018-11-28 12:57:03,329 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 12:57:05,355 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2018-11-28 12:57:05,534 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 54 [2018-11-28 12:57:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:57:07,449 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-28 12:57:07,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-28 12:57:07,450 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 45 [2018-11-28 12:57:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:57:07,450 INFO L225 Difference]: With dead ends: 80 [2018-11-28 12:57:07,450 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:57:07,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1372, Invalid=7180, Unknown=4, NotChecked=0, Total=8556 [2018-11-28 12:57:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:57:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:57:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:57:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:57:07,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-11-28 12:57:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:57:07,453 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:57:07,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 12:57:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:57:07,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:57:07,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 12:57:07,784 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 309 [2018-11-28 12:57:11,884 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2018-11-28 12:57:12,377 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2018-11-28 12:57:12,916 WARN L180 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2018-11-28 12:57:16,980 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2018-11-28 12:57:17,224 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2018-11-28 12:57:18,101 WARN L180 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 45 [2018-11-28 12:57:18,103 INFO L448 ceAbstractionStarter]: For program point initEXIT(lines 12 19) no Hoare annotation was computed. [2018-11-28 12:57:18,103 INFO L444 ceAbstractionStarter]: At program point initENTRY(lines 12 19) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|) (and (exists ((v_main_~i~0_22 Int) (v_main_~pd2~0.base_BEFORE_CALL_1 Int) (v_main_~pd2~0.offset_BEFORE_CALL_1 Int)) (and (<= 0 v_main_~pd2~0.offset_BEFORE_CALL_1) (= v_main_~i~0_22 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (+ (* 4 v_main_~i~0_22) v_main_~pd2~0.offset_BEFORE_CALL_1 8))) (<= v_main_~pd2~0.offset_BEFORE_CALL_1 0))) (= |#memory_int| |old(#memory_int)|))) [2018-11-28 12:57:18,103 INFO L448 ceAbstractionStarter]: For program point initFINAL(lines 12 19) no Hoare annotation was computed. [2018-11-28 12:57:18,103 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:57:18,103 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:57:18,103 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:57:18,103 INFO L448 ceAbstractionStarter]: For program point get_dummyFINAL(lines 21 24) no Hoare annotation was computed. [2018-11-28 12:57:18,104 INFO L451 ceAbstractionStarter]: At program point get_dummyENTRY(lines 21 24) the Hoare annotation is: true [2018-11-28 12:57:18,104 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-28 12:57:18,104 INFO L448 ceAbstractionStarter]: For program point get_dummyEXIT(lines 21 24) no Hoare annotation was computed. [2018-11-28 12:57:18,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:57:18,104 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|))) (and (not (= |~#d2~0.base| |~#d1~0.base|)) (= (select (select |#memory_int| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0) (= 0 |~#d1~0.offset|) (<= .cse0 0) (<= 0 .cse0))) [2018-11-28 12:57:18,104 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:57:18,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:57:18,104 INFO L444 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse1 (+ |~#d1~0.offset| 8))) (let ((.cse0 (select (select |old(#memory_int)| |~#d1~0.base|) .cse1))) (or (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse0 0)) (= .cse0 (select (select |#memory_int| |~#d1~0.base|) .cse1)) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|)))) [2018-11-28 12:57:18,104 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2018-11-28 12:57:18,104 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 31 52) no Hoare annotation was computed. [2018-11-28 12:57:18,105 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 31 52) no Hoare annotation was computed. [2018-11-28 12:57:18,105 INFO L444 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (< 0 |~#d2~0.offset|) (< |~#d1~0.offset| |~#d2~0.offset|) (< (* 5 |~#d2~0.offset|) |~#d1~0.offset|)) [2018-11-28 12:57:18,105 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-11-28 12:57:18,105 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (or (and (exists ((v_main_~i~0_22 Int)) (let ((.cse1 (* 4 v_main_~i~0_22))) (let ((.cse0 (+ main_~pd2~0.offset .cse1 8))) (and (= v_main_~i~0_22 (select (select |#memory_int| main_~pa~0.base) .cse0)) (<= .cse0 main_~pa~0.offset) (<= main_~pa~0.offset (+ .cse1 8)))))) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (<= main_~pd1~0.offset |~#d1~0.offset|) (<= 0 main_~pd2~0.offset) (= main_~pd2~0.base main_~pa~0.base)) (< |~#d2~0.offset| |~#d1~0.offset|) (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (not (= 0 |~#d1~0.offset|)) (< 0 |~#d2~0.offset|)) [2018-11-28 12:57:18,105 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2018-11-28 12:57:18,105 INFO L444 ceAbstractionStarter]: At program point L40-4(lines 40 42) the Hoare annotation is: (let ((.cse1 (+ |~#d1~0.offset| 8))) (let ((.cse0 (select (select |old(#memory_int)| |~#d1~0.base|) .cse1)) (.cse2 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (or (and (< 0 (+ main_~pd1~0.offset 1)) (<= main_~pd1~0.offset 0) (= (select (select |#memory_int| main_~pd2~0.base) (+ 0 8)) main_~i~0) (= 0 main_~i~0) (= main_~pd2~0.offset 0) (= |~#d1~0.base| main_~pd1~0.base) (= .cse0 (select (select |#memory_int| |~#d1~0.base|) .cse1)) (or (<= (+ main_~i~0 1) .cse2) (= 0 .cse2))) (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse0 0)) (not (= 0 |~#d1~0.offset|)) (and (exists ((main_~pa~0.offset Int) (v_main_~i~0_22 Int)) (let ((.cse6 (select |#memory_int| main_~pd2~0.base)) (.cse4 (* 4 v_main_~i~0_22))) (let ((.cse3 (+ main_~pd2~0.offset .cse4 8)) (.cse5 (select .cse6 main_~pa~0.offset))) (and (<= .cse3 main_~pa~0.offset) (<= main_~pa~0.offset (+ .cse4 8)) (<= .cse5 main_~i~0) (= v_main_~i~0_22 (select .cse6 .cse3)) (<= main_~i~0 .cse5))))) (exists ((v_main_~i~0_22 Int)) (let ((.cse8 (* 4 v_main_~i~0_22))) (let ((.cse7 (+ main_~pd2~0.offset .cse8 8))) (and (= v_main_~i~0_22 (select (select |#memory_int| main_~pa~0.base) .cse7)) (<= .cse7 main_~pa~0.offset) (<= main_~pa~0.offset (+ .cse8 8)))))) (<= main_~i~0 .cse2) (<= main_~pd1~0.offset |~#d1~0.offset|) (<= 0 main_~pd2~0.offset) (= main_~pd2~0.base main_~pa~0.base)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|)))) [2018-11-28 12:57:18,105 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-28 12:57:18,106 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2018-11-28 12:57:18,106 INFO L444 ceAbstractionStarter]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse2 (+ |~#d1~0.offset| 8))) (let ((.cse1 (select (select |old(#memory_int)| |~#d1~0.base|) .cse2))) (let ((.cse0 (= .cse1 (select (select |#memory_int| |~#d1~0.base|) .cse2)))) (or (and (< 0 (+ main_~pd1~0.offset 1)) (<= main_~pd1~0.offset 0) (= |~#d1~0.base| main_~pd1~0.base) .cse0) (and (= |~#d2~0.base| main_~pd1~0.base) (= |~#d2~0.offset| main_~pd1~0.offset) .cse0) (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse1 0)) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|))))) [2018-11-28 12:57:18,106 INFO L448 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. [2018-11-28 12:57:18,106 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 31 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|) (and (exists ((v_main_~i~0_22 Int) (v_main_~pd2~0.base_BEFORE_CALL_1 Int) (v_main_~pd2~0.offset_BEFORE_CALL_1 Int)) (and (<= 0 v_main_~pd2~0.offset_BEFORE_CALL_1) (= v_main_~i~0_22 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (+ (* 4 v_main_~i~0_22) v_main_~pd2~0.offset_BEFORE_CALL_1 8))) (<= v_main_~pd2~0.offset_BEFORE_CALL_1 0))) (= |#memory_int| |old(#memory_int)|))) [2018-11-28 12:57:18,106 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-28 12:57:18,106 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 43 45) no Hoare annotation was computed. [2018-11-28 12:57:18,106 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 26 29) the Hoare annotation is: true [2018-11-28 12:57:18,106 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 26 29) no Hoare annotation was computed. [2018-11-28 12:57:18,106 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 26 29) no Hoare annotation was computed. [2018-11-28 12:57:18,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:57:18 BoogieIcfgContainer [2018-11-28 12:57:18,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:57:18,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:57:18,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:57:18,127 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:57:18,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:56:28" (3/4) ... [2018-11-28 12:57:18,130 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:57:18,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-28 12:57:18,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:57:18,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-11-28 12:57:18,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:57:18,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-28 12:57:18,141 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2018-11-28 12:57:18,141 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-28 12:57:18,141 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 12:57:18,141 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 12:57:18,142 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:57:18,142 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:57:18,163 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_main_~i~0_22 : int :: (v_main_~i~0_22 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_22 + 8] && pd2 + 4 * v_main_~i~0_22 + 8 <= pa) && pa <= 4 * v_main_~i~0_22 + 8) && i <= unknown-#memory_int-unknown[pa][pa]) && pd1 <= d1) && 0 <= pd2) && pd2 == pa) || d2 < d1) || d1 == d2) || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || !(0 == d1)) || 0 < d2 [2018-11-28 12:57:18,163 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((d1 == d2 || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || 0 < d2) || d1 < d2) || 5 * d2 < d1 [2018-11-28 12:57:18,181 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f2fdafb3-79bc-4dca-a7d3-c26d90f773d2/bin-2019/uautomizer/witness.graphml [2018-11-28 12:57:18,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:57:18,182 INFO L168 Benchmark]: Toolchain (without parser) took 50011.94 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.4 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 350.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:57:18,182 INFO L168 Benchmark]: CDTParser took 0.18 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 12:57:18,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.58 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:57:18,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.59 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:57:18,183 INFO L168 Benchmark]: Boogie Preprocessor took 76.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:57:18,184 INFO L168 Benchmark]: RCFGBuilder took 299.75 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:57:18,184 INFO L168 Benchmark]: TraceAbstraction took 49366.43 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 352.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.4 MB). Peak memory consumption was 644.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:57:18,184 INFO L168 Benchmark]: Witness Printer took 54.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:57:18,186 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.18 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 189.58 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 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 21.59 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.75 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49366.43 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 352.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.4 MB). Peak memory consumption was 644.2 MB. Max. memory is 11.5 GB. * Witness Printer took 54.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant [2018-11-28 12:57:18,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((d1 == d2 || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || 0 < d2) || d1 < d2) || 5 * d2 < d1 - InvariantResult [Line: 40]: Loop Invariant [2018-11-28 12:57:18,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-28 12:57:18,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:57:18,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((\exists v_main_~i~0_22 : int :: (v_main_~i~0_22 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_22 + 8] && pd2 + 4 * v_main_~i~0_22 + 8 <= pa) && pa <= 4 * v_main_~i~0_22 + 8) && i <= unknown-#memory_int-unknown[pa][pa]) && pd1 <= d1) && 0 <= pd2) && pd2 == pa) || d2 < d1) || d1 == d2) || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || !(0 == d1)) || 0 < d2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. SAFE Result, 49.2s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 24.4s AutomataDifference, 0.0s DeadEndRemovalTime, 10.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 253 SDtfs, 599 SDslu, 2029 SDs, 0 SdLazy, 2576 SolverSat, 458 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 166 SyntacticMatches, 34 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4076 ImplicationChecksByTransitivity, 27.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=7, 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, 9 MinimizatonAttempts, 117 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 27 PreInvPairs, 51 NumberOfFragments, 545 HoareAnnotationTreeSize, 27 FomulaSimplifications, 80928 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 50174 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 524 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 509 ConstructedInterpolants, 33 QuantifiedInterpolants, 207687 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1405 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 93/228 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...