./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-lopstr16/flag_loopdep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-lopstr16/flag_loopdep.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/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 ede152d5cd6ec701bb90258310974118410592fd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:47:03,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:47:03,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:47:03,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:47:03,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:47:03,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:47:03,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:47:03,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:47:03,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:47:03,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:47:03,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:47:03,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:47:03,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:47:03,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:47:03,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:47:03,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:47:03,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:47:03,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:47:03,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:47:03,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:47:03,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:47:03,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:47:03,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:47:03,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:47:03,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:47:03,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:47:03,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:47:03,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:47:03,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:47:03,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:47:03,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:47:03,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:47:03,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:47:03,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:47:03,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:47:03,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:47:03,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:47:03,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:47:03,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:47:03,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:47:03,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:47:03,475 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:47:03,487 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:47:03,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:47:03,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:47:03,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:47:03,489 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:47:03,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:47:03,489 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:47:03,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:47:03,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:47:03,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:47:03,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:47:03,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:47:03,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:47:03,491 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:47:03,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:47:03,491 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:47:03,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:47:03,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:47:03,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:47:03,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:47:03,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:47:03,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:47:03,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:47:03,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:47:03,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:47:03,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:47:03,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:47:03,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:47:03,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/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 -> ede152d5cd6ec701bb90258310974118410592fd [2019-11-20 05:47:03,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:47:03,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:47:03,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:47:03,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:47:03,670 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:47:03,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/../../sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-11-20 05:47:03,722 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/data/4475dee02/6f71571c32d34f98b8e8bd82bff3067b/FLAG25df48aa4 [2019-11-20 05:47:04,128 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:47:04,129 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-11-20 05:47:04,134 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/data/4475dee02/6f71571c32d34f98b8e8bd82bff3067b/FLAG25df48aa4 [2019-11-20 05:47:04,503 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/data/4475dee02/6f71571c32d34f98b8e8bd82bff3067b [2019-11-20 05:47:04,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:47:04,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:47:04,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:47:04,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:47:04,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:47:04,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4e00d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04, skipping insertion in model container [2019-11-20 05:47:04,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,521 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:47:04,535 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:47:04,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:47:04,813 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:47:04,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:47:04,850 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:47:04,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04 WrapperNode [2019-11-20 05:47:04,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:47:04,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:47:04,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:47:04,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:47:04,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:47:04,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:47:04,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:47:04,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:47:04,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... [2019-11-20 05:47:04,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:47:04,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:47:04,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:47:04,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:47:04,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/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 [2019-11-20 05:47:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 05:47:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 05:47:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 05:47:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 05:47:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:47:04,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:47:04,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 05:47:05,221 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:47:05,221 INFO L285 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-20 05:47:05,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:47:05 BoogieIcfgContainer [2019-11-20 05:47:05,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:47:05,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:47:05,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:47:05,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:47:05,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:47:04" (1/3) ... [2019-11-20 05:47:05,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605f716c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:47:05, skipping insertion in model container [2019-11-20 05:47:05,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:47:04" (2/3) ... [2019-11-20 05:47:05,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605f716c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:47:05, skipping insertion in model container [2019-11-20 05:47:05,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:47:05" (3/3) ... [2019-11-20 05:47:05,234 INFO L109 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2019-11-20 05:47:05,244 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:47:05,251 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:47:05,269 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:47:05,315 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:47:05,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:47:05,316 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:47:05,316 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:47:05,316 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:47:05,316 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:47:05,317 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:47:05,317 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:47:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-20 05:47:05,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 05:47:05,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:05,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:05,347 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2019-11-20 05:47:05,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:05,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621023651] [2019-11-20 05:47:05,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:47:05,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621023651] [2019-11-20 05:47:05,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:47:05,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:47:05,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958721534] [2019-11-20 05:47:05,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 05:47:05,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 05:47:05,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:47:05,503 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-20 05:47:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:05,517 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-11-20 05:47:05,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 05:47:05,518 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-20 05:47:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:05,525 INFO L225 Difference]: With dead ends: 36 [2019-11-20 05:47:05,525 INFO L226 Difference]: Without dead ends: 16 [2019-11-20 05:47:05,527 INFO L630 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 [2019-11-20 05:47:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-20 05:47:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-20 05:47:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 05:47:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-20 05:47:05,551 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2019-11-20 05:47:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:05,552 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-20 05:47:05,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 05:47:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-11-20 05:47:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 05:47:05,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:05,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:05,554 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:05,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2019-11-20 05:47:05,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:05,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867060378] [2019-11-20 05:47:05,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:47:05,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867060378] [2019-11-20 05:47:05,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:47:05,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:47:05,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386340859] [2019-11-20 05:47:05,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:47:05,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:05,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:47:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:47:05,609 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 3 states. [2019-11-20 05:47:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:05,663 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-20 05:47:05,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:47:05,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 05:47:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:05,665 INFO L225 Difference]: With dead ends: 34 [2019-11-20 05:47:05,665 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 05:47:05,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:47:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 05:47:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2019-11-20 05:47:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 05:47:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-20 05:47:05,670 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-20 05:47:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:05,670 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-20 05:47:05,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:47:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-20 05:47:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:47:05,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:05,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:05,671 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:05,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1200955363, now seen corresponding path program 1 times [2019-11-20 05:47:05,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:05,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384419215] [2019-11-20 05:47:05,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:47:05,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384419215] [2019-11-20 05:47:05,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:47:05,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:47:05,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475945323] [2019-11-20 05:47:05,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:47:05,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:47:05,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:47:05,720 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2019-11-20 05:47:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:05,736 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-11-20 05:47:05,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:47:05,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 05:47:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:05,738 INFO L225 Difference]: With dead ends: 31 [2019-11-20 05:47:05,738 INFO L226 Difference]: Without dead ends: 17 [2019-11-20 05:47:05,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:47:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-20 05:47:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-20 05:47:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 05:47:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-20 05:47:05,743 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2019-11-20 05:47:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:05,743 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-20 05:47:05,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:47:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-20 05:47:05,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:47:05,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:05,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:05,744 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:05,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:05,745 INFO L82 PathProgramCache]: Analyzing trace with hash 391608737, now seen corresponding path program 1 times [2019-11-20 05:47:05,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:05,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324192593] [2019-11-20 05:47:05,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:47:05,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324192593] [2019-11-20 05:47:05,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:47:05,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:47:05,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112210783] [2019-11-20 05:47:05,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:47:05,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:05,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:47:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:47:05,795 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-11-20 05:47:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:05,813 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-20 05:47:05,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:47:05,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 05:47:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:05,814 INFO L225 Difference]: With dead ends: 32 [2019-11-20 05:47:05,814 INFO L226 Difference]: Without dead ends: 19 [2019-11-20 05:47:05,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:47:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-20 05:47:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-20 05:47:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-20 05:47:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-20 05:47:05,818 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-11-20 05:47:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:05,819 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-20 05:47:05,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:47:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-11-20 05:47:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 05:47:05,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:05,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:05,820 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2019-11-20 05:47:05,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:05,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464752335] [2019-11-20 05:47:05,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:47:05,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464752335] [2019-11-20 05:47:05,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68883639] [2019-11-20 05:47:05,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:05,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 05:47:05,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:47:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:47:06,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:47:06,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 05:47:06,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138484219] [2019-11-20 05:47:06,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:47:06,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:06,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:47:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:47:06,004 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2019-11-20 05:47:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:06,029 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-20 05:47:06,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:47:06,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-20 05:47:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:06,031 INFO L225 Difference]: With dead ends: 34 [2019-11-20 05:47:06,031 INFO L226 Difference]: Without dead ends: 21 [2019-11-20 05:47:06,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:47:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-20 05:47:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-20 05:47:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 05:47:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-20 05:47:06,035 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2019-11-20 05:47:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:06,035 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-20 05:47:06,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:47:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-20 05:47:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 05:47:06,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:06,036 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:06,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:06,240 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1949671069, now seen corresponding path program 2 times [2019-11-20 05:47:06,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:06,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981234757] [2019-11-20 05:47:06,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:47:06,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981234757] [2019-11-20 05:47:06,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89895271] [2019-11-20 05:47:06,332 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:06,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:47:06,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:47:06,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 05:47:06,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:47:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:47:06,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:47:06,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 05:47:06,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079918188] [2019-11-20 05:47:06,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:47:06,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:47:06,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:47:06,455 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 8 states. [2019-11-20 05:47:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:06,484 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-11-20 05:47:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:47:06,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-20 05:47:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:06,487 INFO L225 Difference]: With dead ends: 36 [2019-11-20 05:47:06,487 INFO L226 Difference]: Without dead ends: 23 [2019-11-20 05:47:06,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:47:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-20 05:47:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-20 05:47:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 05:47:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-20 05:47:06,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2019-11-20 05:47:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:06,494 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-20 05:47:06,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:47:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-20 05:47:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 05:47:06,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:06,502 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:06,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:06,705 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:06,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:06,705 INFO L82 PathProgramCache]: Analyzing trace with hash 381595099, now seen corresponding path program 3 times [2019-11-20 05:47:06,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:06,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922434024] [2019-11-20 05:47:06,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:47:06,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922434024] [2019-11-20 05:47:06,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126466032] [2019-11-20 05:47:06,815 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:06,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-20 05:47:06,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:47:06,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:47:06,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:47:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 05:47:06,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:47:06,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-20 05:47:06,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960063647] [2019-11-20 05:47:06,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:47:06,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:06,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:47:06,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:47:06,892 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2019-11-20 05:47:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:06,973 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-20 05:47:06,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 05:47:06,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-20 05:47:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:06,975 INFO L225 Difference]: With dead ends: 57 [2019-11-20 05:47:06,975 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 05:47:06,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:47:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 05:47:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-11-20 05:47:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 05:47:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-20 05:47:06,980 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-11-20 05:47:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:06,981 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-20 05:47:06,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:47:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-20 05:47:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 05:47:06,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:06,982 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:07,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:07,185 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 4 times [2019-11-20 05:47:07,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:07,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27024265] [2019-11-20 05:47:07,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:47:07,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27024265] [2019-11-20 05:47:07,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127750906] [2019-11-20 05:47:07,287 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:07,338 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 05:47:07,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:47:07,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 05:47:07,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:47:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:47:07,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:47:07,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-20 05:47:07,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325968302] [2019-11-20 05:47:07,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 05:47:07,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 05:47:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:47:07,386 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 10 states. [2019-11-20 05:47:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:07,511 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-11-20 05:47:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 05:47:07,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-20 05:47:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:07,513 INFO L225 Difference]: With dead ends: 72 [2019-11-20 05:47:07,513 INFO L226 Difference]: Without dead ends: 56 [2019-11-20 05:47:07,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:47:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-20 05:47:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-11-20 05:47:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 05:47:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-20 05:47:07,519 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2019-11-20 05:47:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:07,519 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-20 05:47:07,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 05:47:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-20 05:47:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 05:47:07,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:07,522 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:07,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:07,726 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:07,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:07,727 INFO L82 PathProgramCache]: Analyzing trace with hash -441689129, now seen corresponding path program 5 times [2019-11-20 05:47:07,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:07,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746186278] [2019-11-20 05:47:07,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 05:47:07,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746186278] [2019-11-20 05:47:07,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896308402] [2019-11-20 05:47:07,887 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:07,969 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-20 05:47:07,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:47:07,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 05:47:07,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:47:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 05:47:08,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:47:08,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-20 05:47:08,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346223123] [2019-11-20 05:47:08,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 05:47:08,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:08,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 05:47:08,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-20 05:47:08,032 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2019-11-20 05:47:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:08,150 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-11-20 05:47:08,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 05:47:08,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-11-20 05:47:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:08,152 INFO L225 Difference]: With dead ends: 87 [2019-11-20 05:47:08,152 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 05:47:08,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-20 05:47:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 05:47:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2019-11-20 05:47:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-20 05:47:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-20 05:47:08,159 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2019-11-20 05:47:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:08,159 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-20 05:47:08,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 05:47:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-20 05:47:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 05:47:08,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:08,165 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:08,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:08,368 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1895354217, now seen corresponding path program 6 times [2019-11-20 05:47:08,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:08,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507890860] [2019-11-20 05:47:08,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 05:47:08,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507890860] [2019-11-20 05:47:08,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639048154] [2019-11-20 05:47:08,511 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:08,592 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-20 05:47:08,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:47:08,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 05:47:08,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:47:08,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:47:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 05:47:08,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:47:08,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-20 05:47:08,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346926284] [2019-11-20 05:47:08,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 05:47:08,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:08,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 05:47:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:47:08,752 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2019-11-20 05:47:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:09,099 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-20 05:47:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 05:47:09,099 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-20 05:47:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:09,100 INFO L225 Difference]: With dead ends: 71 [2019-11-20 05:47:09,100 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 05:47:09,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2019-11-20 05:47:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 05:47:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-11-20 05:47:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 05:47:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-20 05:47:09,106 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2019-11-20 05:47:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:09,106 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-20 05:47:09,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 05:47:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-20 05:47:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 05:47:09,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:09,107 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:09,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:09,310 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash -958805492, now seen corresponding path program 1 times [2019-11-20 05:47:09,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:09,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301222428] [2019-11-20 05:47:09,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-20 05:47:09,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301222428] [2019-11-20 05:47:09,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:47:09,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:47:09,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872526859] [2019-11-20 05:47:09,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:47:09,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:47:09,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:47:09,391 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2019-11-20 05:47:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:09,395 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-20 05:47:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:47:09,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 05:47:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:09,397 INFO L225 Difference]: With dead ends: 49 [2019-11-20 05:47:09,397 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 05:47:09,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:47:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 05:47:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-20 05:47:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 05:47:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-20 05:47:09,402 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2019-11-20 05:47:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:09,402 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-20 05:47:09,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:47:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-20 05:47:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 05:47:09,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:09,406 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:09,407 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:09,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1921874774, now seen corresponding path program 1 times [2019-11-20 05:47:09,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:09,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070123006] [2019-11-20 05:47:09,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 05:47:09,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070123006] [2019-11-20 05:47:09,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83716392] [2019-11-20 05:47:09,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:09,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 05:47:09,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:47:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 05:47:09,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:47:09,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 05:47:09,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569279073] [2019-11-20 05:47:09,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 05:47:09,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:09,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 05:47:09,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-20 05:47:09,767 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 18 states. [2019-11-20 05:47:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:09,815 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-20 05:47:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 05:47:09,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-11-20 05:47:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:09,816 INFO L225 Difference]: With dead ends: 70 [2019-11-20 05:47:09,816 INFO L226 Difference]: Without dead ends: 45 [2019-11-20 05:47:09,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-20 05:47:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-20 05:47:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-20 05:47:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 05:47:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-11-20 05:47:09,822 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2019-11-20 05:47:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:09,823 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-11-20 05:47:09,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 05:47:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-11-20 05:47:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 05:47:09,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:09,824 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:10,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:10,028 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:10,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:10,028 INFO L82 PathProgramCache]: Analyzing trace with hash 575418516, now seen corresponding path program 2 times [2019-11-20 05:47:10,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:10,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92137310] [2019-11-20 05:47:10,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 05:47:10,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92137310] [2019-11-20 05:47:10,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943834164] [2019-11-20 05:47:10,163 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:10,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:47:10,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:47:10,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 05:47:10,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:47:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 05:47:10,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:47:10,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-20 05:47:10,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918405920] [2019-11-20 05:47:10,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 05:47:10,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 05:47:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-20 05:47:10,428 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 20 states. [2019-11-20 05:47:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:10,483 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-20 05:47:10,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 05:47:10,485 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-11-20 05:47:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:10,486 INFO L225 Difference]: With dead ends: 72 [2019-11-20 05:47:10,486 INFO L226 Difference]: Without dead ends: 47 [2019-11-20 05:47:10,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-20 05:47:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-20 05:47:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-20 05:47:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 05:47:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-11-20 05:47:10,494 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-11-20 05:47:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:10,495 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-11-20 05:47:10,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 05:47:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-11-20 05:47:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 05:47:10,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:47:10,502 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:47:10,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:10,712 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:47:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:47:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash -583889326, now seen corresponding path program 3 times [2019-11-20 05:47:10,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:47:10,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649957506] [2019-11-20 05:47:10,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:47:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:47:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 05:47:10,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649957506] [2019-11-20 05:47:10,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552600749] [2019-11-20 05:47:10,850 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:10,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 05:47:10,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:47:10,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 05:47:10,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:47:10,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-20 05:47:10,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:47:11,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:47:11,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:47:11,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-20 05:47:11,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:47:11,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-11-20 05:47:11,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:47:11,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 05:47:11,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:47:11,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:47:11,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:47:11,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-11-20 05:47:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-20 05:47:11,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:47:11,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-11-20 05:47:11,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151124364] [2019-11-20 05:47:11,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 05:47:11,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:47:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 05:47:11,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-20 05:47:11,242 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 19 states. [2019-11-20 05:47:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:47:12,497 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-20 05:47:12,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 05:47:12,498 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-11-20 05:47:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:47:12,498 INFO L225 Difference]: With dead ends: 63 [2019-11-20 05:47:12,499 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 05:47:12,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2019-11-20 05:47:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 05:47:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 05:47:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 05:47:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 05:47:12,501 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-20 05:47:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:47:12,501 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 05:47:12,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 05:47:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 05:47:12,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 05:47:12,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:47:12,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 05:47:12,883 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-20 05:47:12,952 INFO L444 ceAbstractionStarter]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-11-20 05:47:12,952 INFO L444 ceAbstractionStarter]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-11-20 05:47:12,952 INFO L444 ceAbstractionStarter]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-11-20 05:47:12,952 INFO L440 ceAbstractionStarter]: At program point L31-3(lines 31 35) the Hoare annotation is: (= ULTIMATE.start_main_~flag~0 1) [2019-11-20 05:47:12,952 INFO L444 ceAbstractionStarter]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-11-20 05:47:12,952 INFO L447 ceAbstractionStarter]: At program point L36(lines 17 37) the Hoare annotation is: true [2019-11-20 05:47:12,952 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 05:47:12,952 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 05:47:12,952 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 05:47:12,953 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-11-20 05:47:12,953 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-11-20 05:47:12,953 INFO L440 ceAbstractionStarter]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (<= 999999 v_ULTIMATE.start_init_~i~0_26) (< v_ULTIMATE.start_init_~i~0_26 1000000)))) (.cse3 (= ULTIMATE.start_main_~flag~0 0)) (.cse4 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse5 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1))))) (.cse6 (= ULTIMATE.start_init_~size 1000000))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~i~1 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|)) .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 0) .cse4 .cse5 (<= ULTIMATE.start_main_~i~1 999999) .cse6) (= ULTIMATE.start_main_~flag~0 1))) [2019-11-20 05:47:12,953 INFO L444 ceAbstractionStarter]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-11-20 05:47:12,953 INFO L444 ceAbstractionStarter]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-11-20 05:47:12,953 INFO L440 ceAbstractionStarter]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (= ULTIMATE.start_main_~flag~0 0)) (.cse3 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse4 (= ULTIMATE.start_init_~size 1000000))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1)))) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_init_~i~0 0) .cse4))) [2019-11-20 05:47:12,953 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-11-20 05:47:12,953 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 05:47:12,953 INFO L444 ceAbstractionStarter]: For program point L9(lines 9 16) no Hoare annotation was computed. [2019-11-20 05:47:12,953 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-11-20 05:47:12,953 INFO L444 ceAbstractionStarter]: For program point L2(line 2) no Hoare annotation was computed. [2019-11-20 05:47:12,963 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,964 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,964 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:47:12,965 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,966 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,966 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,969 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,971 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,971 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,971 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,975 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,976 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,977 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:47:12,977 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,978 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,979 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,982 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,982 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,984 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,985 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,986 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:12,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:12,996 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:12,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:47:12 BoogieIcfgContainer [2019-11-20 05:47:12,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:47:12,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:47:12,998 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:47:12,998 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:47:12,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:47:05" (3/4) ... [2019-11-20 05:47:13,001 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 05:47:13,010 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-20 05:47:13,010 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 05:47:13,010 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 05:47:13,035 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == 0 && a == a) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) || (((((a == 0 && a == a) && flag == 0) && a == a) && i == 0) && size == 1000000) [2019-11-20 05:47:13,036 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) || (((((((((0 == #memory_$Pointer$[a][a] && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && i <= 999999) && size == 1000000)) || flag == 1 [2019-11-20 05:47:13,056 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bc310afd-0fee-4960-8cc9-3106205c0463/bin/uautomizer/witness.graphml [2019-11-20 05:47:13,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:47:13,058 INFO L168 Benchmark]: Toolchain (without parser) took 8551.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 950.1 MB in the beginning and 940.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 192.2 MB. Max. memory is 11.5 GB. [2019-11-20 05:47:13,058 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:47:13,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:47:13,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:47:13,059 INFO L168 Benchmark]: Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:47:13,060 INFO L168 Benchmark]: RCFGBuilder took 312.93 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:47:13,060 INFO L168 Benchmark]: TraceAbstraction took 7773.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.1 GB in the beginning and 948.7 MB in the end (delta: 168.7 MB). Peak memory consumption was 205.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:47:13,061 INFO L168 Benchmark]: Witness Printer took 58.83 ms. Allocated memory is still 1.2 GB. Free memory was 948.7 MB in the beginning and 940.9 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:47:13,063 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 312.93 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7773.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.1 GB in the beginning and 948.7 MB in the end (delta: 168.7 MB). Peak memory consumption was 205.4 MB. Max. memory is 11.5 GB. * Witness Printer took 58.83 ms. Allocated memory is still 1.2 GB. Free memory was 948.7 MB in the beginning and 940.9 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: 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: 24]: Loop Invariant [2019-11-20 05:47:13,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,076 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,077 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:47:13,077 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,078 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,078 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,082 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:47:13,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) || (((((((((0 == #memory_$Pointer$[a][a] && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && i <= 999999) && size == 1000000)) || flag == 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2019-11-20 05:47:13,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,090 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:47:13,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:47:13,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-20 05:47:13,092 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((a == 0 && a == a) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) || (((((a == 0 && a == a) && flag == 0) && a == a) && i == 0) && size == 1000000) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Result: SAFE, OverallTime: 7.6s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 214 SDtfs, 241 SDslu, 499 SDs, 0 SdLazy, 507 SolverSat, 69 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 202 HoareAnnotationTreeSize, 4 FomulaSimplifications, 627 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 619 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 596 ConstructedInterpolants, 12 QuantifiedInterpolants, 79467 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1175 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 424/879 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...