./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loops-crafted-1/nested3_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/nested3_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 70ed6db55ef12ba895ae550f72b14964713abf72 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:31:28,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:31:28,377 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:31:28,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:31:28,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:31:28,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:31:28,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:31:28,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:31:28,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:31:28,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:31:28,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:31:28,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:31:28,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:31:28,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:31:28,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:31:28,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:31:28,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:31:28,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:31:28,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:31:28,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:31:28,395 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:31:28,396 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:31:28,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:31:28,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:31:28,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:31:28,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:31:28,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:31:28,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:31:28,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:31:28,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:31:28,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:31:28,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:31:28,402 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:31:28,402 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:31:28,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:31:28,403 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:31:28,403 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 12:31:28,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:31:28,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:31:28,411 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:31:28,411 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 12:31:28,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:31:28,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:31:28,412 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:31:28,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:31:28,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:31:28,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:31:28,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:31:28,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:31:28,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:31:28,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:31:28,413 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:31:28,413 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:31:28,413 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:31:28,414 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:31:28,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:31:28,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:31:28,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:31:28,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:31:28,414 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:31:28,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:31:28,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:31:28,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:31:28,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:31:28,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:31:28,415 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:31:28,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:31:28,415 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70ed6db55ef12ba895ae550f72b14964713abf72 [2018-11-18 12:31:28,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:31:28,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:31:28,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:31:28,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:31:28,453 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:31:28,453 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/../../sv-benchmarks/c/loops-crafted-1/nested3_true-unreach-call.c [2018-11-18 12:31:28,499 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/data/6bc8bd659/6cfeb51ae6f0467783f30b3a58988b3b/FLAGb3b34d7d6 [2018-11-18 12:31:28,815 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:31:28,816 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/sv-benchmarks/c/loops-crafted-1/nested3_true-unreach-call.c [2018-11-18 12:31:28,820 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/data/6bc8bd659/6cfeb51ae6f0467783f30b3a58988b3b/FLAGb3b34d7d6 [2018-11-18 12:31:28,832 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/data/6bc8bd659/6cfeb51ae6f0467783f30b3a58988b3b [2018-11-18 12:31:28,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:31:28,836 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 12:31:28,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:31:28,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:31:28,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:31:28,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:31:28" (1/1) ... [2018-11-18 12:31:28,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a19fc73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28, skipping insertion in model container [2018-11-18 12:31:28,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:31:28" (1/1) ... [2018-11-18 12:31:28,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:31:28,863 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:31:28,972 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:31:28,975 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:31:28,988 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:31:28,998 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:31:28,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28 WrapperNode [2018-11-18 12:31:28,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:31:28,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:31:28,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:31:28,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:31:29,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28" (1/1) ... [2018-11-18 12:31:29,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28" (1/1) ... [2018-11-18 12:31:29,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28" (1/1) ... [2018-11-18 12:31:29,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28" (1/1) ... [2018-11-18 12:31:29,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28" (1/1) ... [2018-11-18 12:31:29,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28" (1/1) ... [2018-11-18 12:31:29,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28" (1/1) ... [2018-11-18 12:31:29,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:31:29,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:31:29,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:31:29,018 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:31:29,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:31:29,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:31:29,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:31:29,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 12:31:29,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:31:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 12:31:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 12:31:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:31:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:31:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:31:29,197 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:31:29,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:31:29 BoogieIcfgContainer [2018-11-18 12:31:29,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:31:29,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:31:29,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:31:29,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:31:29,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:31:28" (1/3) ... [2018-11-18 12:31:29,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7962ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:31:29, skipping insertion in model container [2018-11-18 12:31:29,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:31:28" (2/3) ... [2018-11-18 12:31:29,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7962ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:31:29, skipping insertion in model container [2018-11-18 12:31:29,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:31:29" (3/3) ... [2018-11-18 12:31:29,204 INFO L112 eAbstractionObserver]: Analyzing ICFG nested3_true-unreach-call.c [2018-11-18 12:31:29,211 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:31:29,217 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:31:29,227 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:31:29,248 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:31:29,249 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:31:29,249 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:31:29,249 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:31:29,249 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:31:29,249 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:31:29,249 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:31:29,249 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:31:29,249 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:31:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-18 12:31:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 12:31:29,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:29,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:29,270 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:29,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:29,273 INFO L82 PathProgramCache]: Analyzing trace with hash 17946046, now seen corresponding path program 1 times [2018-11-18 12:31:29,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:29,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:29,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:31:29,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:31:29,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:31:29,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:31:29,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 12:31:29,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:31:29,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:31:29,349 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-18 12:31:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:31:29,363 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2018-11-18 12:31:29,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:31:29,364 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 12:31:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:31:29,370 INFO L225 Difference]: With dead ends: 47 [2018-11-18 12:31:29,370 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 12:31:29,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:31:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 12:31:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 12:31:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 12:31:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-18 12:31:29,395 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 10 [2018-11-18 12:31:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:31:29,395 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-18 12:31:29,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 12:31:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-18 12:31:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 12:31:29,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:29,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:29,396 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:29,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash -583657870, now seen corresponding path program 1 times [2018-11-18 12:31:29,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:29,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:31:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:31:29,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:31:29,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:31:29,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:31:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:31:29,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:31:29,474 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2018-11-18 12:31:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:31:29,492 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-18 12:31:29,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:31:29,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 12:31:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:31:29,494 INFO L225 Difference]: With dead ends: 39 [2018-11-18 12:31:29,494 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 12:31:29,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:31:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 12:31:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-18 12:31:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 12:31:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-18 12:31:29,499 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2018-11-18 12:31:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:31:29,499 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-18 12:31:29,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:31:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-18 12:31:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 12:31:29,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:29,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:29,500 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:29,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2034978746, now seen corresponding path program 1 times [2018-11-18 12:31:29,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:29,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:31:29,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:31:29,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:31:29,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:31:29,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:31:29,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:31:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:31:29,558 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-18 12:31:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:31:29,583 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-18 12:31:29,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:31:29,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-18 12:31:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:31:29,584 INFO L225 Difference]: With dead ends: 47 [2018-11-18 12:31:29,584 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 12:31:29,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:31:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 12:31:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-18 12:31:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 12:31:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-18 12:31:29,588 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-18 12:31:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:31:29,588 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-18 12:31:29,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:31:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-18 12:31:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:31:29,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:29,589 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:29,589 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:29,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:29,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2046656706, now seen corresponding path program 1 times [2018-11-18 12:31:29,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:29,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:31:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:31:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:31:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:31:29,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:31:29,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:31:29,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:31:29,664 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-18 12:31:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:31:29,679 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-18 12:31:29,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:31:29,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 12:31:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:31:29,680 INFO L225 Difference]: With dead ends: 49 [2018-11-18 12:31:29,680 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 12:31:29,681 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:31:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 12:31:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-18 12:31:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 12:31:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-18 12:31:29,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2018-11-18 12:31:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:31:29,685 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 12:31:29,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:31:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 12:31:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 12:31:29,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:29,686 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:29,686 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:29,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash 441532680, now seen corresponding path program 1 times [2018-11-18 12:31:29,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:29,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:29,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:31:29,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:31:29,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:31:29,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:31:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:31:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:29,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:31:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:31:29,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:31:29,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 12:31:29,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:31:29,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:31:29,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:31:29,837 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-18 12:31:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:31:29,851 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-18 12:31:29,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:31:29,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-18 12:31:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:31:29,852 INFO L225 Difference]: With dead ends: 53 [2018-11-18 12:31:29,853 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 12:31:29,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:31:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 12:31:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 12:31:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 12:31:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-18 12:31:29,857 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-11-18 12:31:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:31:29,858 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 12:31:29,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:31:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 12:31:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 12:31:29,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:29,859 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:29,859 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:29,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash -189397042, now seen corresponding path program 2 times [2018-11-18 12:31:29,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:29,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:29,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:31:29,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:31:29,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:31:29,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:31:29,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:31:29,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:31:29,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:31:29,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:31:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:31:29,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:31:29,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 12:31:29,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:31:29,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:31:29,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:31:29,966 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2018-11-18 12:31:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:31:29,987 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-18 12:31:29,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:31:29,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-18 12:31:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:31:29,988 INFO L225 Difference]: With dead ends: 57 [2018-11-18 12:31:29,988 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 12:31:29,988 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:31:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 12:31:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-18 12:31:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 12:31:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-18 12:31:29,993 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-18 12:31:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:31:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-18 12:31:29,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:31:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-18 12:31:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 12:31:29,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:29,994 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:29,994 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:29,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash -922471148, now seen corresponding path program 3 times [2018-11-18 12:31:29,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:29,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:29,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:31:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:31:30,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:31:30,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:31:30,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:31:30,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 12:31:30,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:31:30,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:31:30,610 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 19 [2018-11-18 12:31:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 12:31:36,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:31:36,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-18 12:31:36,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:31:36,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:31:36,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2018-11-18 12:31:36,371 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2018-11-18 12:31:36,816 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 12:31:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:31:37,661 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-18 12:31:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:31:37,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-18 12:31:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:31:37,663 INFO L225 Difference]: With dead ends: 65 [2018-11-18 12:31:37,663 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 12:31:37,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=33, Invalid=98, Unknown=1, NotChecked=0, Total=132 [2018-11-18 12:31:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 12:31:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-18 12:31:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 12:31:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-18 12:31:37,667 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2018-11-18 12:31:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:31:37,667 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-18 12:31:37,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:31:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-18 12:31:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 12:31:37,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:37,668 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:37,669 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:37,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:37,669 INFO L82 PathProgramCache]: Analyzing trace with hash 470622036, now seen corresponding path program 1 times [2018-11-18 12:31:37,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:37,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:37,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:37,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:31:37,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 12:31:37,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:31:37,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:31:37,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:31:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:37,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:31:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 12:31:37,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:31:37,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2018-11-18 12:31:37,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:31:37,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:31:37,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:31:37,786 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-11-18 12:31:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:31:37,822 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-11-18 12:31:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:31:37,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-18 12:31:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:31:37,823 INFO L225 Difference]: With dead ends: 97 [2018-11-18 12:31:37,823 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 12:31:37,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:31:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 12:31:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-11-18 12:31:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 12:31:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-18 12:31:37,831 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 31 [2018-11-18 12:31:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:31:37,831 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-18 12:31:37,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:31:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-18 12:31:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 12:31:37,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:37,832 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:37,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:37,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1847065710, now seen corresponding path program 2 times [2018-11-18 12:31:37,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:37,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:31:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 4 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 12:31:37,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:31:37,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:31:37,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:31:37,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:31:37,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:31:37,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:31:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 12:31:38,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:31:38,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2018-11-18 12:31:38,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:31:38,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:31:38,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:31:38,019 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 9 states. [2018-11-18 12:31:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:31:38,094 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2018-11-18 12:31:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:31:38,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-11-18 12:31:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:31:38,095 INFO L225 Difference]: With dead ends: 125 [2018-11-18 12:31:38,096 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 12:31:38,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:31:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 12:31:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-11-18 12:31:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 12:31:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-11-18 12:31:38,104 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 49 [2018-11-18 12:31:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:31:38,105 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-11-18 12:31:38,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:31:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-18 12:31:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 12:31:38,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:31:38,106 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:31:38,106 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:31:38,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:31:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash 190023432, now seen corresponding path program 3 times [2018-11-18 12:31:38,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:31:38,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:31:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:38,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:31:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:31:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:31:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 12:31:38,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:31:38,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:31:38,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:31:38,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 12:31:38,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:31:38,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:31:53,871 WARN L180 SmtUtils]: Spent 5.33 s on a formula simplification. DAG size of input: 90 DAG size of output: 19 [2018-11-18 12:31:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 12:31:56,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:31:56,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-18 12:31:56,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:31:56,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:31:56,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=76, Unknown=5, NotChecked=0, Total=110 [2018-11-18 12:31:56,108 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 11 states. [2018-11-18 12:32:02,266 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_8 Int)) (let ((.cse0 (mod v_prenex_8 4294967296)) (.cse1 (mod v_prenex_8 2))) (and (<= 268435455 .cse0) (<= 0 .cse0) (<= .cse1 2147483647) (= .cse1 c___VERIFIER_assert_~cond) (< (mod (+ v_prenex_8 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_8 Int)) (let ((.cse3 (mod v_prenex_8 4294967296)) (.cse2 (mod v_prenex_8 2))) (and (= |c___VERIFIER_assert_#in~cond| .cse2) (<= 268435455 .cse3) (<= 0 .cse3) (<= .cse2 2147483647) (< (mod (+ v_prenex_8 4294967295) 4294967296) 268435455))))) is different from true [2018-11-18 12:32:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:32:06,298 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-18 12:32:06,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:32:06,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-11-18 12:32:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:32:06,299 INFO L225 Difference]: With dead ends: 155 [2018-11-18 12:32:06,299 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 12:32:06,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=45, Invalid=109, Unknown=6, NotChecked=22, Total=182 [2018-11-18 12:32:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 12:32:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-18 12:32:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 12:32:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-11-18 12:32:06,311 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 67 [2018-11-18 12:32:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:32:06,311 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-11-18 12:32:06,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:32:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-11-18 12:32:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 12:32:06,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:32:06,313 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 7, 6, 6, 6, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:32:06,313 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:32:06,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:32:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash 791159479, now seen corresponding path program 1 times [2018-11-18 12:32:06,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:32:06,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:32:06,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:32:06,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:32:06,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:32:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:32:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2018-11-18 12:32:06,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:32:06,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:32:06,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:32:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:32:06,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:32:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 12 proven. 228 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-18 12:32:06,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:32:06,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2018-11-18 12:32:06,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:32:06,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:32:06,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:32:06,480 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 7 states. [2018-11-18 12:32:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:32:06,531 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2018-11-18 12:32:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:32:06,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-18 12:32:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:32:06,533 INFO L225 Difference]: With dead ends: 253 [2018-11-18 12:32:06,533 INFO L226 Difference]: Without dead ends: 246 [2018-11-18 12:32:06,533 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:32:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-18 12:32:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 172. [2018-11-18 12:32:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 12:32:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2018-11-18 12:32:06,554 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 111 [2018-11-18 12:32:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:32:06,554 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2018-11-18 12:32:06,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:32:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-11-18 12:32:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-18 12:32:06,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:32:06,557 INFO L375 BasicCegarLoop]: trace histogram [50, 40, 13, 12, 12, 12, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:32:06,557 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:32:06,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:32:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash -407926660, now seen corresponding path program 2 times [2018-11-18 12:32:06,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:32:06,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:32:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:32:06,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:32:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:32:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:32:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2968 backedges. 24 proven. 1380 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2018-11-18 12:32:06,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:32:06,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:32:06,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:32:06,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:32:06,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:32:06,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:32:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2968 backedges. 476 proven. 20 refuted. 0 times theorem prover too weak. 2472 trivial. 0 not checked. [2018-11-18 12:32:06,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:32:06,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2018-11-18 12:32:06,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:32:06,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:32:06,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:32:06,891 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand 11 states. [2018-11-18 12:32:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:32:07,174 INFO L93 Difference]: Finished difference Result 483 states and 557 transitions. [2018-11-18 12:32:07,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 12:32:07,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 211 [2018-11-18 12:32:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:32:07,175 INFO L225 Difference]: With dead ends: 483 [2018-11-18 12:32:07,175 INFO L226 Difference]: Without dead ends: 330 [2018-11-18 12:32:07,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-11-18 12:32:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-18 12:32:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 254. [2018-11-18 12:32:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-18 12:32:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 289 transitions. [2018-11-18 12:32:07,198 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 289 transitions. Word has length 211 [2018-11-18 12:32:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:32:07,198 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 289 transitions. [2018-11-18 12:32:07,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:32:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 289 transitions. [2018-11-18 12:32:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-18 12:32:07,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:32:07,202 INFO L375 BasicCegarLoop]: trace histogram [78, 63, 19, 18, 18, 18, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:32:07,202 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:32:07,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:32:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 876120915, now seen corresponding path program 3 times [2018-11-18 12:32:07,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:32:07,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:32:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:32:07,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:32:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:32:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:32:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7188 backedges. 2990 proven. 590 refuted. 0 times theorem prover too weak. 3608 trivial. 0 not checked. [2018-11-18 12:32:07,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:32:07,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:32:07,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:32:07,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 12:32:07,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:32:07,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:32:09,509 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_20 Int)) (let ((.cse0 (mod v_prenex_20 4294967296)) (.cse1 (mod v_prenex_20 2))) (and (<= 0 .cse0) (= .cse1 |c___VERIFIER_assert_#in~cond|) (< (mod (+ v_prenex_20 4294967295) 4294967296) 268435455) (<= .cse1 2147483647) (<= 268435455 .cse0) (< 2147483647 (mod (+ .cse1 4294967294) 4294967296))))) (exists ((v_prenex_19 Int)) (let ((.cse2 (mod v_prenex_19 2))) (and (< 2147483647 (mod (+ .cse2 4294967294) 4294967296)) (= .cse2 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (<= 268435455 (mod v_prenex_19 4294967296)) (< 2147483647 .cse2) (= .cse2 0) (< (mod (+ v_prenex_19 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_14 Int)) (let ((.cse3 (mod v_prenex_14 2))) (and (<= 268435455 (mod v_prenex_14 4294967296)) (<= .cse3 2147483647) (= .cse3 |c___VERIFIER_assert_#in~cond|) (< (mod (+ v_prenex_14 4294967295) 4294967296) 268435455) (= .cse3 0) (<= (mod (+ .cse3 4294967294) 4294967296) 2147483647)))) (exists ((v_prenex_12 Int)) (let ((.cse4 (mod v_prenex_12 2))) (and (< (mod (+ v_prenex_12 4294967295) 4294967296) 268435455) (= .cse4 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (= .cse4 0) (<= 268435455 (mod v_prenex_12 4294967296)) (<= (mod (+ .cse4 4294967294) 4294967296) 2147483647) (< 2147483647 .cse4)))) (exists ((v_main_~x~0_BEFORE_CALL_13 Int)) (let ((.cse7 (mod v_main_~x~0_BEFORE_CALL_13 2))) (let ((.cse6 (mod (+ .cse7 4294967294) 4294967296)) (.cse5 (mod v_main_~x~0_BEFORE_CALL_13 4294967296))) (and (< .cse5 0) (< 2147483647 .cse6) (<= .cse7 2147483647) (not (= .cse7 0)) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse6) (<= 268435455 .cse5) (< (mod (+ v_main_~x~0_BEFORE_CALL_13 4294967295) 4294967296) 268435455))))) (exists ((v_prenex_18 Int)) (let ((.cse10 (mod v_prenex_18 2))) (let ((.cse8 (mod v_prenex_18 4294967296)) (.cse9 (mod (+ .cse10 4294967294) 4294967296))) (and (<= 268435455 .cse8) (= .cse9 |c___VERIFIER_assert_#in~cond|) (<= .cse10 2147483647) (not (= .cse10 0)) (< .cse8 0) (<= .cse9 2147483647) (< (mod (+ v_prenex_18 4294967295) 4294967296) 268435455))))) (exists ((v_prenex_21 Int)) (let ((.cse11 (mod v_prenex_21 2))) (let ((.cse12 (mod v_prenex_21 4294967296)) (.cse13 (mod (+ .cse11 4294967294) 4294967296))) (and (< 2147483647 .cse11) (< .cse12 0) (<= 268435455 .cse12) (< (mod (+ v_prenex_21 4294967295) 4294967296) 268435455) (not (= .cse11 0)) (<= .cse13 2147483647) (= .cse13 |c___VERIFIER_assert_#in~cond|))))) (exists ((v_prenex_17 Int)) (let ((.cse14 (mod v_prenex_17 2))) (let ((.cse15 (mod v_prenex_17 4294967296)) (.cse16 (mod (+ .cse14 4294967294) 4294967296))) (and (< 2147483647 .cse14) (not (= .cse14 0)) (< .cse15 0) (< 2147483647 .cse16) (<= 268435455 .cse15) (< (mod (+ v_prenex_17 4294967295) 4294967296) 268435455) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse16))))) (exists ((v_prenex_16 Int)) (let ((.cse17 (mod v_prenex_16 2))) (and (<= .cse17 2147483647) (< (mod (+ v_prenex_16 4294967295) 4294967296) 268435455) (<= 268435455 (mod v_prenex_16 4294967296)) (= .cse17 |c___VERIFIER_assert_#in~cond|) (< 2147483647 (mod (+ .cse17 4294967294) 4294967296)) (= .cse17 0)))) (exists ((v_prenex_15 Int)) (let ((.cse19 (mod v_prenex_15 4294967296)) (.cse18 (mod v_prenex_15 2))) (and (= .cse18 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (<= (mod (+ .cse18 4294967294) 4294967296) 2147483647) (<= 0 .cse19) (<= 268435455 .cse19) (< 2147483647 .cse18) (< (mod (+ v_prenex_15 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_13 Int)) (let ((.cse20 (mod v_prenex_13 2)) (.cse21 (mod v_prenex_13 4294967296))) (and (= .cse20 |c___VERIFIER_assert_#in~cond|) (<= 268435455 .cse21) (<= .cse20 2147483647) (<= (mod (+ .cse20 4294967294) 4294967296) 2147483647) (<= 0 .cse21) (< (mod (+ v_prenex_13 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_11 Int)) (let ((.cse23 (mod v_prenex_11 4294967296)) (.cse22 (mod v_prenex_11 2))) (and (< 2147483647 (mod (+ .cse22 4294967294) 4294967296)) (< 2147483647 .cse22) (<= 268435455 .cse23) (<= 0 .cse23) (= .cse22 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (< (mod (+ v_prenex_11 4294967295) 4294967296) 268435455))))) is different from false [2018-11-18 12:32:11,545 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_12 Int)) (let ((.cse0 (mod v_prenex_12 2))) (and (< (mod (+ v_prenex_12 4294967295) 4294967296) 268435455) (= .cse0 0) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse0) (<= 268435455 (mod v_prenex_12 4294967296)) (<= (mod (+ .cse0 4294967294) 4294967296) 2147483647) (< 2147483647 .cse0)))) (exists ((v_prenex_19 Int)) (let ((.cse1 (mod v_prenex_19 2))) (and (< 2147483647 (mod (+ .cse1 4294967294) 4294967296)) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse1) (<= 268435455 (mod v_prenex_19 4294967296)) (< 2147483647 .cse1) (= .cse1 0) (< (mod (+ v_prenex_19 4294967295) 4294967296) 268435455)))) (exists ((v_main_~x~0_BEFORE_CALL_13 Int)) (let ((.cse4 (mod v_main_~x~0_BEFORE_CALL_13 2))) (let ((.cse2 (mod v_main_~x~0_BEFORE_CALL_13 4294967296)) (.cse3 (mod (+ .cse4 4294967294) 4294967296))) (and (< .cse2 0) (< 2147483647 .cse3) (<= .cse4 2147483647) (not (= .cse4 0)) (<= 268435455 .cse2) (= .cse3 (+ c___VERIFIER_assert_~cond 4294967296)) (< (mod (+ v_main_~x~0_BEFORE_CALL_13 4294967295) 4294967296) 268435455))))) (exists ((v_prenex_16 Int)) (let ((.cse5 (mod v_prenex_16 2))) (and (<= .cse5 2147483647) (< (mod (+ v_prenex_16 4294967295) 4294967296) 268435455) (= .cse5 c___VERIFIER_assert_~cond) (<= 268435455 (mod v_prenex_16 4294967296)) (< 2147483647 (mod (+ .cse5 4294967294) 4294967296)) (= .cse5 0)))) (exists ((v_prenex_17 Int)) (let ((.cse6 (mod v_prenex_17 2))) (let ((.cse8 (mod (+ .cse6 4294967294) 4294967296)) (.cse7 (mod v_prenex_17 4294967296))) (and (< 2147483647 .cse6) (not (= .cse6 0)) (< .cse7 0) (< 2147483647 .cse8) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse8) (<= 268435455 .cse7) (< (mod (+ v_prenex_17 4294967295) 4294967296) 268435455))))) (exists ((v_prenex_14 Int)) (let ((.cse9 (mod v_prenex_14 2))) (and (<= 268435455 (mod v_prenex_14 4294967296)) (<= .cse9 2147483647) (< (mod (+ v_prenex_14 4294967295) 4294967296) 268435455) (= .cse9 0) (<= (mod (+ .cse9 4294967294) 4294967296) 2147483647) (= .cse9 c___VERIFIER_assert_~cond)))) (exists ((v_prenex_18 Int)) (let ((.cse11 (mod v_prenex_18 2))) (let ((.cse10 (mod v_prenex_18 4294967296)) (.cse12 (mod (+ .cse11 4294967294) 4294967296))) (and (<= 268435455 .cse10) (<= .cse11 2147483647) (= .cse12 c___VERIFIER_assert_~cond) (not (= .cse11 0)) (< .cse10 0) (<= .cse12 2147483647) (< (mod (+ v_prenex_18 4294967295) 4294967296) 268435455))))) (exists ((v_prenex_21 Int)) (let ((.cse13 (mod v_prenex_21 2))) (let ((.cse14 (mod v_prenex_21 4294967296)) (.cse15 (mod (+ .cse13 4294967294) 4294967296))) (and (< 2147483647 .cse13) (< .cse14 0) (<= 268435455 .cse14) (< (mod (+ v_prenex_21 4294967295) 4294967296) 268435455) (not (= .cse13 0)) (<= .cse15 2147483647) (= .cse15 c___VERIFIER_assert_~cond))))) (exists ((v_prenex_15 Int)) (let ((.cse17 (mod v_prenex_15 4294967296)) (.cse16 (mod v_prenex_15 2))) (and (<= (mod (+ .cse16 4294967294) 4294967296) 2147483647) (<= 0 .cse17) (<= 268435455 .cse17) (< 2147483647 .cse16) (= .cse16 (+ c___VERIFIER_assert_~cond 4294967296)) (< (mod (+ v_prenex_15 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_11 Int)) (let ((.cse18 (mod v_prenex_11 2)) (.cse19 (mod v_prenex_11 4294967296))) (and (= (+ c___VERIFIER_assert_~cond 4294967296) .cse18) (< 2147483647 (mod (+ .cse18 4294967294) 4294967296)) (< 2147483647 .cse18) (<= 268435455 .cse19) (<= 0 .cse19) (< (mod (+ v_prenex_11 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_20 Int)) (let ((.cse20 (mod v_prenex_20 4294967296)) (.cse21 (mod v_prenex_20 2))) (and (<= 0 .cse20) (< (mod (+ v_prenex_20 4294967295) 4294967296) 268435455) (= .cse21 c___VERIFIER_assert_~cond) (<= .cse21 2147483647) (<= 268435455 .cse20) (< 2147483647 (mod (+ .cse21 4294967294) 4294967296))))) (exists ((v_prenex_13 Int)) (let ((.cse23 (mod v_prenex_13 2)) (.cse22 (mod v_prenex_13 4294967296))) (and (<= 268435455 .cse22) (<= .cse23 2147483647) (= .cse23 c___VERIFIER_assert_~cond) (<= (mod (+ .cse23 4294967294) 4294967296) 2147483647) (<= 0 .cse22) (< (mod (+ v_prenex_13 4294967295) 4294967296) 268435455))))) is different from true [2018-11-18 12:32:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7188 backedges. 2994 proven. 0 refuted. 0 times theorem prover too weak. 4194 trivial. 0 not checked. [2018-11-18 12:32:13,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:32:13,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-11-18 12:32:13,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:32:13,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:32:13,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=87, Unknown=2, NotChecked=38, Total=156 [2018-11-18 12:32:13,656 INFO L87 Difference]: Start difference. First operand 254 states and 289 transitions. Second operand 13 states. [2018-11-18 12:32:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:32:14,016 INFO L93 Difference]: Finished difference Result 503 states and 578 transitions. [2018-11-18 12:32:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 12:32:14,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 317 [2018-11-18 12:32:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:32:14,017 INFO L225 Difference]: With dead ends: 503 [2018-11-18 12:32:14,017 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 12:32:14,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=124, Invalid=434, Unknown=2, NotChecked=90, Total=650 [2018-11-18 12:32:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 12:32:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 12:32:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 12:32:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 12:32:14,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 317 [2018-11-18 12:32:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:32:14,019 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:32:14,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:32:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:32:14,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 12:32:14,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 12:32:14,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,433 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 217 [2018-11-18 12:32:14,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:32:14,859 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 37 [2018-11-18 12:32:15,052 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 12:32:15,828 WARN L180 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 43 [2018-11-18 12:32:16,099 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-11-18 12:32:16,250 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-11-18 12:32:16,252 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 12:32:16,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:32:16,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:32:16,252 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 12:32:16,252 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 12:32:16,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:32:16,252 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-18 12:32:16,253 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 33) no Hoare annotation was computed. [2018-11-18 12:32:16,253 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 23) no Hoare annotation was computed. [2018-11-18 12:32:16,253 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 26) no Hoare annotation was computed. [2018-11-18 12:32:16,253 INFO L421 ceAbstractionStarter]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse0 (< (mod main_~y~0 4294967296) 268435455)) (.cse5 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) (.cse7 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455)) (.cse9 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse6 (<= 0 main_~y~0)) (.cse10 (< (mod main_~x~0 4294967296) 268435455)) (.cse11 (= main_~z~0 0)) (.cse8 (<= main_~y~0 0)) (.cse12 (= main_~y~0 1)) (.cse1 (<= main_~z~0 0)) (.cse2 (<= main_~x~0 0)) (.cse3 (< 0 (+ (div main_~z~0 4294967296) 1))) (.cse4 (<= 0 main_~x~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse8) (and .cse9 .cse10 .cse0 .cse7 .cse5) (and .cse6 .cse2 .cse11 .cse4 .cse8) (and .cse0 .cse7 .cse2 .cse4 .cse5) (and .cse12 .cse7 .cse2 .cse4) (and .cse9 .cse10 .cse0 .cse1 .cse3 .cse5) (and .cse9 .cse10 (and .cse6 .cse7) .cse8) (and .cse9 .cse6 .cse10 .cse11 .cse8) (and .cse12 .cse1 .cse2 .cse3 .cse4))) [2018-11-18 12:32:16,253 INFO L421 ceAbstractionStarter]: At program point L21-4(lines 21 23) the Hoare annotation is: (let ((.cse2 (<= 268435455 (mod main_~z~0 4294967296))) (.cse3 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455))) (let ((.cse1 (<= 0 main_~y~0)) (.cse5 (<= main_~y~0 0)) (.cse6 (<= main_~x~0 0)) (.cse7 (<= 0 main_~x~0)) (.cse0 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse8 (and .cse2 .cse3)) (.cse9 (< (mod main_~y~0 4294967296) 268435455)) (.cse10 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) (.cse4 (< (mod main_~x~0 4294967296) 268435455))) (or (and .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse7 .cse5) (and (= main_~y~0 1) .cse2 .cse3 .cse6 .cse7) (and .cse8 .cse9 .cse6 .cse7 .cse10) (and .cse0 (and .cse8 .cse9 .cse10) .cse4)))) [2018-11-18 12:32:16,253 INFO L421 ceAbstractionStarter]: At program point L19-3(lines 19 26) the Hoare annotation is: (let ((.cse4 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) (.cse0 (<= 268435455 (mod main_~z~0 4294967296))) (.cse2 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455)) (.cse5 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse6 (< (mod main_~x~0 4294967296) 268435455)) (.cse7 (<= 0 main_~y~0)) (.cse1 (<= main_~x~0 0)) (.cse3 (<= 0 main_~x~0)) (.cse8 (<= main_~y~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse2 .cse4) (and (and (or (and .cse0 .cse2) (and (<= 0 main_~z~0) (<= main_~z~0 0))) .cse7) .cse5 .cse6 .cse8) (and .cse7 .cse1 (= main_~z~0 0) .cse3 .cse8))) [2018-11-18 12:32:16,253 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 26) the Hoare annotation is: (let ((.cse0 (<= 268435455 (mod main_~y~0 4294967296))) (.cse1 (<= 268435455 (mod main_~z~0 4294967296))) (.cse2 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455)) (.cse3 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455))) (or (and .cse0 .cse1 (<= main_~x~0 0) .cse2 (<= 0 main_~x~0) .cse3) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455) .cse0 .cse1 .cse2 .cse3))) [2018-11-18 12:32:16,253 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 33) no Hoare annotation was computed. [2018-11-18 12:32:16,253 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 33) the Hoare annotation is: true [2018-11-18 12:32:16,254 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-18 12:32:16,254 INFO L425 ceAbstractionStarter]: For program point L16-1(lines 16 30) no Hoare annotation was computed. [2018-11-18 12:32:16,254 INFO L421 ceAbstractionStarter]: At program point L16-3(lines 16 30) the Hoare annotation is: (or (and (<= 0 main_~y~0) (<= main_~x~0 0) (= main_~z~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~y~0 4294967296)) (<= 268435455 (mod main_~z~0 4294967296)) (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455) (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455))) [2018-11-18 12:32:16,254 INFO L421 ceAbstractionStarter]: At program point L16-4(lines 16 30) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~y~0 4294967296)) (<= 268435455 (mod main_~x~0 4294967296)) (<= 268435455 (mod main_~z~0 4294967296)) (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455) (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) [2018-11-18 12:32:16,254 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-18 12:32:16,254 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-18 12:32:16,254 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-18 12:32:16,254 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-18 12:32:16,254 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-18 12:32:16,254 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-18 12:32:16,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:32:16 BoogieIcfgContainer [2018-11-18 12:32:16,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:32:16,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:32:16,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:32:16,268 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:32:16,268 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:31:29" (3/4) ... [2018-11-18 12:32:16,273 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 12:32:16,278 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 12:32:16,279 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 12:32:16,279 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-18 12:32:16,282 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-18 12:32:16,282 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-18 12:32:16,282 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 12:32:16,316 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_44f4529a-e538-4f8b-bbae-62126e1f55e4/bin-2019/uautomizer/witness.graphml [2018-11-18 12:32:16,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:32:16,317 INFO L168 Benchmark]: Toolchain (without parser) took 47482.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:32:16,318 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:32:16,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.33 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:32:16,318 INFO L168 Benchmark]: Boogie Preprocessor took 18.39 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 945.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:32:16,318 INFO L168 Benchmark]: RCFGBuilder took 180.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:32:16,318 INFO L168 Benchmark]: TraceAbstraction took 47069.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.7 MB). Peak memory consumption was 335.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:32:16,319 INFO L168 Benchmark]: Witness Printer took 48.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:32:16,323 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.33 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.39 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 945.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 180.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47069.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.7 MB). Peak memory consumption was 335.2 MB. Max. memory is 11.5 GB. * Witness Printer took 48.57 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 21]: Loop Invariant Derived loop invariant: (((((((((((((y % 4294967296 < 268435455 && z <= 0) && x <= 0) && 0 < z / 4294967296 + 1) && 0 <= x) && (y + 4294967295) % 4294967296 < 268435455) || ((((0 <= y && x <= 0) && (z + 4294967295) % 4294967296 < 268435455) && 0 <= x) && y <= 0)) || (((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && y % 4294967296 < 268435455) && (z + 4294967295) % 4294967296 < 268435455) && (y + 4294967295) % 4294967296 < 268435455)) || ((((0 <= y && x <= 0) && z == 0) && 0 <= x) && y <= 0)) || ((((y % 4294967296 < 268435455 && (z + 4294967295) % 4294967296 < 268435455) && x <= 0) && 0 <= x) && (y + 4294967295) % 4294967296 < 268435455)) || (((y == 1 && (z + 4294967295) % 4294967296 < 268435455) && x <= 0) && 0 <= x)) || ((((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && y % 4294967296 < 268435455) && z <= 0) && 0 < z / 4294967296 + 1) && (y + 4294967295) % 4294967296 < 268435455)) || ((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && 0 <= y && (z + 4294967295) % 4294967296 < 268435455) && y <= 0)) || (((((x + 4294967295) % 4294967296 < 268435455 && 0 <= y) && x % 4294967296 < 268435455) && z == 0) && y <= 0)) || ((((y == 1 && z <= 0) && x <= 0) && 0 < z / 4294967296 + 1) && 0 <= x) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((0 <= y && x <= 0) && z == 0) && 0 <= x) && y <= 0) || (((((x + 4294967295) % 4294967296 < 268435455 && 268435455 <= y % 4294967296) && 268435455 <= z % 4294967296) && (z + 4294967295) % 4294967296 < 268435455) && (y + 4294967295) % 4294967296 < 268435455) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((268435455 <= z % 4294967296 && x <= 0) && (z + 4294967295) % 4294967296 < 268435455) && 0 <= x) && (y + 4294967295) % 4294967296 < 268435455) || (((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && 268435455 <= z % 4294967296) && (z + 4294967295) % 4294967296 < 268435455) && (y + 4294967295) % 4294967296 < 268435455)) || ((((((268435455 <= z % 4294967296 && (z + 4294967295) % 4294967296 < 268435455) || (0 <= z && z <= 0)) && 0 <= y) && (x + 4294967295) % 4294967296 < 268435455) && x % 4294967296 < 268435455) && y <= 0)) || ((((0 <= y && x <= 0) && z == 0) && 0 <= x) && y <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 47.0s OverallTime, 13 OverallIterations, 78 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 307 SDslu, 1473 SDs, 0 SdLazy, 797 SolverSat, 154 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 941 GetRequests, 824 SyntacticMatches, 17 SemanticMatches, 100 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 31.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 198 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 94 PreInvPairs, 252 NumberOfFragments, 672 HoareAnnotationTreeSize, 94 FomulaSimplifications, 24452 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 11 FomulaSimplificationsInter, 7784 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 31.4s InterpolantComputationTime, 1735 NumberOfCodeBlocks, 1391 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1713 ConstructedInterpolants, 6 QuantifiedInterpolants, 1272417 SizeOfPredicates, 13 NumberOfNonLiveVariables, 992 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 19984/22552 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...