./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-acceleration/nested_true-unreach-call1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-acceleration/nested_true-unreach-call1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/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 a5caa00ae79e87f00b53813a39ed64b4be57c6c3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:34:32,870 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:34:32,871 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:34:32,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:34:32,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:34:32,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:34:32,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:34:32,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:34:32,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:34:32,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:34:32,883 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:34:32,883 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:34:32,884 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:34:32,885 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:34:32,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:34:32,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:34:32,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:34:32,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:34:32,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:34:32,891 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:34:32,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:34:32,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:34:32,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:34:32,894 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:34:32,894 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:34:32,895 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:34:32,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:34:32,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:34:32,897 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:34:32,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:34:32,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:34:32,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:34:32,898 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:34:32,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:34:32,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:34:32,900 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:34:32,900 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:34:32,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:34:32,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:34:32,909 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:34:32,910 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:34:32,910 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:34:32,910 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:34:32,911 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:34:32,911 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:34:32,911 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:34:32,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:34:32,911 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:34:32,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:34:32,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:34:32,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:34:32,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:34:32,912 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:34:32,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:34:32,912 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:34:32,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:34:32,912 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:34:32,912 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:34:32,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:34:32,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:34:32,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:34:32,913 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:34:32,913 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:34:32,913 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:34:32,913 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:34:32,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:34:32,914 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_c159f89c-3412-48d3-81bc-9a116a3dd7f0/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 -> a5caa00ae79e87f00b53813a39ed64b4be57c6c3 [2018-11-10 07:34:32,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:34:32,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:34:32,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:34:32,947 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:34:32,947 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:34:32,948 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/../../sv-benchmarks/c/loop-acceleration/nested_true-unreach-call1.i [2018-11-10 07:34:32,984 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/data/b63d66410/10fd195c884f4d5faa90490a6d965806/FLAG6d47ab317 [2018-11-10 07:34:33,377 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:34:33,377 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/sv-benchmarks/c/loop-acceleration/nested_true-unreach-call1.i [2018-11-10 07:34:33,381 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/data/b63d66410/10fd195c884f4d5faa90490a6d965806/FLAG6d47ab317 [2018-11-10 07:34:33,390 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/data/b63d66410/10fd195c884f4d5faa90490a6d965806 [2018-11-10 07:34:33,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:34:33,394 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:34:33,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:34:33,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:34:33,397 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:34:33,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:34:33" (1/1) ... [2018-11-10 07:34:33,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32089edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33, skipping insertion in model container [2018-11-10 07:34:33,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:34:33" (1/1) ... [2018-11-10 07:34:33,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:34:33,415 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:34:33,508 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:34:33,511 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:34:33,520 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:34:33,529 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:34:33,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33 WrapperNode [2018-11-10 07:34:33,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:34:33,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:34:33,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:34:33,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:34:33,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33" (1/1) ... [2018-11-10 07:34:33,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33" (1/1) ... [2018-11-10 07:34:33,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33" (1/1) ... [2018-11-10 07:34:33,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33" (1/1) ... [2018-11-10 07:34:33,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33" (1/1) ... [2018-11-10 07:34:33,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33" (1/1) ... [2018-11-10 07:34:33,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33" (1/1) ... [2018-11-10 07:34:33,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:34:33,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:34:33,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:34:33,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:34:33,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/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-10 07:34:33,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:34:33,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:34:33,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 07:34:33,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:34:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:34:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 07:34:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:34:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:34:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:34:33,716 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:34:33,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:34:33 BoogieIcfgContainer [2018-11-10 07:34:33,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:34:33,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:34:33,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:34:33,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:34:33,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:34:33" (1/3) ... [2018-11-10 07:34:33,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d31c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:34:33, skipping insertion in model container [2018-11-10 07:34:33,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:34:33" (2/3) ... [2018-11-10 07:34:33,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d31c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:34:33, skipping insertion in model container [2018-11-10 07:34:33,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:34:33" (3/3) ... [2018-11-10 07:34:33,722 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i [2018-11-10 07:34:33,728 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:34:33,732 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:34:33,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:34:33,757 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:34:33,758 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:34:33,758 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:34:33,758 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:34:33,758 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:34:33,758 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:34:33,758 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:34:33,758 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:34:33,759 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:34:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-10 07:34:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 07:34:33,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:33,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:33,774 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:33,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:33,778 INFO L82 PathProgramCache]: Analyzing trace with hash -283544510, now seen corresponding path program 1 times [2018-11-10 07:34:33,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:34:33,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:34:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:33,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:33,849 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-10 07:34:33,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:34:33,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:34:33,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:34:33,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:34:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:34:33,862 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-10 07:34:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:33,876 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-10 07:34:33,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:34:33,877 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-10 07:34:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:33,884 INFO L225 Difference]: With dead ends: 37 [2018-11-10 07:34:33,884 INFO L226 Difference]: Without dead ends: 15 [2018-11-10 07:34:33,886 INFO L605 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-10 07:34:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-10 07:34:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-10 07:34:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 07:34:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-10 07:34:33,907 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-10 07:34:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:33,907 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-10 07:34:33,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:34:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-10 07:34:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 07:34:33,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:33,908 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:33,908 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:33,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:33,909 INFO L82 PathProgramCache]: Analyzing trace with hash -863512858, now seen corresponding path program 1 times [2018-11-10 07:34:33,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:34:33,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:34:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:33,957 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-10 07:34:33,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:34:33,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:34:33,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:34:33,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:34:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:34:33,959 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-10 07:34:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:33,969 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-10 07:34:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:34:33,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 07:34:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:33,971 INFO L225 Difference]: With dead ends: 25 [2018-11-10 07:34:33,971 INFO L226 Difference]: Without dead ends: 20 [2018-11-10 07:34:33,971 INFO L605 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-10 07:34:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-10 07:34:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-10 07:34:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 07:34:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 07:34:33,974 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-10 07:34:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:33,974 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 07:34:33,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:34:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-10 07:34:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 07:34:33,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:33,975 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:33,975 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:33,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:33,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1427803270, now seen corresponding path program 1 times [2018-11-10 07:34:33,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:34:33,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:34:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:33,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:34:34,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:34:34,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:34:34,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:34:34,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:34:34,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:34:34,012 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2018-11-10 07:34:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:34,023 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-10 07:34:34,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:34:34,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-10 07:34:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:34,024 INFO L225 Difference]: With dead ends: 29 [2018-11-10 07:34:34,024 INFO L226 Difference]: Without dead ends: 19 [2018-11-10 07:34:34,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:34:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-10 07:34:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 07:34:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 07:34:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 07:34:34,032 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-11-10 07:34:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:34,032 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 07:34:34,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:34:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-10 07:34:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 07:34:34,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:34,033 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:34,033 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:34,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179828, now seen corresponding path program 1 times [2018-11-10 07:34:34,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:34:34,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:34:34,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:34,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:34:34,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:34:34,094 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/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-10 07:34:34,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:34,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:34:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:34:34,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:34:34,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-11-10 07:34:34,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:34:34,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:34:34,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:34:34,166 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 7 states. [2018-11-10 07:34:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:34,283 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-10 07:34:34,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:34:34,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-10 07:34:34,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:34,285 INFO L225 Difference]: With dead ends: 49 [2018-11-10 07:34:34,285 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 07:34:34,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:34:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 07:34:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-11-10 07:34:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 07:34:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-10 07:34:34,291 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2018-11-10 07:34:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:34,291 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-10 07:34:34,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:34:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-10 07:34:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:34:34,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:34,292 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:34,292 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:34,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1070919706, now seen corresponding path program 2 times [2018-11-10 07:34:34,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:34:34,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:34:34,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:34,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:34:34,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 07:34:34,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:34:34,371 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/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-10 07:34:34,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:34:34,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:34:34,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:34:34,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:34:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 07:34:34,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:34:34,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 07:34:34,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:34:34,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:34:34,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:34:34,443 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2018-11-10 07:34:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:34,626 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-10 07:34:34,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 07:34:34,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-10 07:34:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:34,629 INFO L225 Difference]: With dead ends: 71 [2018-11-10 07:34:34,629 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 07:34:34,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-10 07:34:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 07:34:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-10 07:34:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 07:34:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-10 07:34:34,638 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 29 [2018-11-10 07:34:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:34,638 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-10 07:34:34,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:34:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-10 07:34:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 07:34:34,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:34:34,639 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:34:34,639 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:34:34,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:34:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1068904040, now seen corresponding path program 3 times [2018-11-10 07:34:34,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:34:34,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:34:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:34,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:34:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:34:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:34:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 07:34:34,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:34:34,724 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/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-10 07:34:34,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:34:34,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 07:34:34,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:34:34,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:34:36,801 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (let ((.cse0 (mod v_main_~x~0_BEFORE_CALL_1 2))) (and (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_1 4294967296)) (= .cse0 |c___VERIFIER_assert_#in~cond|) (= .cse0 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= .cse0 2147483647)))) (exists ((v_prenex_5 Int)) (let ((.cse3 (mod v_prenex_5 2))) (let ((.cse1 (mod (+ .cse3 4294967294) 4294967296)) (.cse2 (mod v_prenex_5 4294967296))) (and (<= .cse1 2147483647) (<= 268435455 .cse2) (= |c___VERIFIER_assert_#in~cond| .cse1) (< .cse2 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= .cse3 0)))))) (exists ((v_prenex_4 Int)) (let ((.cse5 (mod v_prenex_4 4294967296)) (.cse4 (mod v_prenex_4 2))) (and (< 2147483647 .cse4) (<= 0 .cse5) (<= 268435455 .cse5) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse4) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_3 Int)) (let ((.cse8 (mod v_prenex_3 2))) (let ((.cse7 (mod v_prenex_3 4294967296)) (.cse6 (mod (+ .cse8 4294967294) 4294967296))) (and (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse6) (<= 268435455 .cse7) (< .cse7 0) (< 2147483647 .cse6) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (not (= .cse8 0)))))) (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 2))) (and (<= 268435455 (mod v_prenex_1 4294967296)) (< 2147483647 .cse9) (= .cse9 0) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse9)))) (exists ((v_prenex_2 Int)) (let ((.cse10 (mod v_prenex_2 4294967296)) (.cse11 (mod v_prenex_2 2))) (and (<= 0 .cse10) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse11 2147483647) (<= 268435455 .cse10) (= .cse11 |c___VERIFIER_assert_#in~cond|))))) is different from true [2018-11-10 07:34:38,823 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (let ((.cse0 (mod v_main_~x~0_BEFORE_CALL_1 2))) (and (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_1 4294967296)) (= .cse0 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= .cse0 2147483647) (= .cse0 c___VERIFIER_assert_~cond)))) (exists ((v_prenex_5 Int)) (let ((.cse3 (mod v_prenex_5 2))) (let ((.cse1 (mod (+ .cse3 4294967294) 4294967296)) (.cse2 (mod v_prenex_5 4294967296))) (and (<= .cse1 2147483647) (= .cse1 c___VERIFIER_assert_~cond) (<= 268435455 .cse2) (< .cse2 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= .cse3 0)))))) (exists ((v_prenex_2 Int)) (let ((.cse4 (mod v_prenex_2 2)) (.cse5 (mod v_prenex_2 4294967296))) (and (= .cse4 c___VERIFIER_assert_~cond) (<= 0 .cse5) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse4 2147483647) (<= 268435455 .cse5)))) (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 2))) (and (<= 268435455 (mod v_prenex_1 4294967296)) (< 2147483647 .cse6) (= .cse6 0) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse6)))) (exists ((v_prenex_3 Int)) (let ((.cse9 (mod v_prenex_3 2))) (let ((.cse8 (mod v_prenex_3 4294967296)) (.cse7 (mod (+ .cse9 4294967294) 4294967296))) (and (= (+ c___VERIFIER_assert_~cond 4294967296) .cse7) (<= 268435455 .cse8) (< .cse8 0) (< 2147483647 .cse7) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (not (= .cse9 0)))))) (exists ((v_prenex_4 Int)) (let ((.cse10 (mod v_prenex_4 2)) (.cse11 (mod v_prenex_4 4294967296))) (and (= (+ c___VERIFIER_assert_~cond 4294967296) .cse10) (< 2147483647 .cse10) (<= 0 .cse11) (<= 268435455 .cse11) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455))))) is different from false [2018-11-10 07:34:40,856 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (let ((.cse0 (mod v_main_~x~0_BEFORE_CALL_1 2))) (and (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_1 4294967296)) (= .cse0 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= .cse0 2147483647) (= .cse0 c___VERIFIER_assert_~cond)))) (exists ((v_prenex_5 Int)) (let ((.cse3 (mod v_prenex_5 2))) (let ((.cse1 (mod (+ .cse3 4294967294) 4294967296)) (.cse2 (mod v_prenex_5 4294967296))) (and (<= .cse1 2147483647) (= .cse1 c___VERIFIER_assert_~cond) (<= 268435455 .cse2) (< .cse2 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= .cse3 0)))))) (exists ((v_prenex_2 Int)) (let ((.cse4 (mod v_prenex_2 2)) (.cse5 (mod v_prenex_2 4294967296))) (and (= .cse4 c___VERIFIER_assert_~cond) (<= 0 .cse5) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse4 2147483647) (<= 268435455 .cse5)))) (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 2))) (and (<= 268435455 (mod v_prenex_1 4294967296)) (< 2147483647 .cse6) (= .cse6 0) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse6)))) (exists ((v_prenex_3 Int)) (let ((.cse9 (mod v_prenex_3 2))) (let ((.cse8 (mod v_prenex_3 4294967296)) (.cse7 (mod (+ .cse9 4294967294) 4294967296))) (and (= (+ c___VERIFIER_assert_~cond 4294967296) .cse7) (<= 268435455 .cse8) (< .cse8 0) (< 2147483647 .cse7) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (not (= .cse9 0)))))) (exists ((v_prenex_4 Int)) (let ((.cse10 (mod v_prenex_4 2)) (.cse11 (mod v_prenex_4 4294967296))) (and (= (+ c___VERIFIER_assert_~cond 4294967296) .cse10) (< 2147483647 .cse10) (<= 0 .cse11) (<= 268435455 .cse11) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455))))) is different from true [2018-11-10 07:34:46,901 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int)) (let ((.cse0 (mod v_prenex_2 4294967296)) (.cse1 (mod v_prenex_2 2))) (and (<= 0 .cse0) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse1 2147483647) (<= 268435455 .cse0) (= .cse1 0)))) is different from false [2018-11-10 07:34:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 07:34:46,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:34:46,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-11-10 07:34:46,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 07:34:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 07:34:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=58, Unknown=4, NotChecked=48, Total=132 [2018-11-10 07:34:46,927 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 12 states. [2018-11-10 07:34:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:34:47,055 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-11-10 07:34:47,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 07:34:47,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-11-10 07:34:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:34:47,056 INFO L225 Difference]: With dead ends: 80 [2018-11-10 07:34:47,056 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:34:47,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=70, Invalid=244, Unknown=4, NotChecked=102, Total=420 [2018-11-10 07:34:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:34:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:34:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:34:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:34:47,058 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-11-10 07:34:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:34:47,058 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:34:47,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 07:34:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:34:47,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:34:47,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:34:47,148 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:34:47,148 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:34:47,148 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:34:47,148 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:34:47,148 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:34:47,148 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:34:47,148 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 19) no Hoare annotation was computed. [2018-11-10 07:34:47,149 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 19) no Hoare annotation was computed. [2018-11-10 07:34:47,149 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2018-11-10 07:34:47,149 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 17) no Hoare annotation was computed. [2018-11-10 07:34:47,151 INFO L421 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (= main_~x~0 0) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455))) [2018-11-10 07:34:47,151 INFO L425 ceAbstractionStarter]: For program point L13-4(lines 13 15) no Hoare annotation was computed. [2018-11-10 07:34:47,151 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 17) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (and (<= 0 main_~y~0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) [2018-11-10 07:34:47,151 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 17) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296))) [2018-11-10 07:34:47,151 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 19) the Hoare annotation is: true [2018-11-10 07:34:47,151 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-10 07:34:47,151 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-10 07:34:47,151 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-10 07:34:47,152 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-10 07:34:47,152 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-10 07:34:47,152 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-10 07:34:47,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:34:47 BoogieIcfgContainer [2018-11-10 07:34:47,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:34:47,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:34:47,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:34:47,163 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:34:47,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:34:33" (3/4) ... [2018-11-10 07:34:47,167 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:34:47,173 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:34:47,173 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:34:47,173 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 07:34:47,176 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-10 07:34:47,177 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 07:34:47,177 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:34:47,202 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c159f89c-3412-48d3-81bc-9a116a3dd7f0/bin-2019/uautomizer/witness.graphml [2018-11-10 07:34:47,202 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:34:47,203 INFO L168 Benchmark]: Toolchain (without parser) took 13810.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 960.2 MB in the beginning and 958.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 155.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:47,204 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:34:47,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 134.75 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:47,204 INFO L168 Benchmark]: Boogie Preprocessor took 16.84 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:34:47,205 INFO L168 Benchmark]: RCFGBuilder took 170.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:47,205 INFO L168 Benchmark]: TraceAbstraction took 13445.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 961.6 MB in the end (delta: 178.3 MB). Peak memory consumption was 178.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:47,206 INFO L168 Benchmark]: Witness Printer took 39.57 ms. Allocated memory is still 1.2 GB. Free memory was 961.6 MB in the beginning and 958.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:34:47,208 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 134.75 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.84 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13445.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 961.6 MB in the end (delta: 178.3 MB). Peak memory consumption was 178.3 MB. Max. memory is 11.5 GB. * Witness Printer took 39.57 ms. Allocated memory is still 1.2 GB. Free memory was 961.6 MB in the beginning and 958.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 268435455 || (((0 <= y && x <= 0) && 0 <= x) && y <= 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x == 0 || ((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 13.4s OverallTime, 6 OverallIterations, 12 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 112 SDtfs, 33 SDslu, 260 SDs, 0 SdLazy, 227 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 34 NumberOfFragments, 56 HoareAnnotationTreeSize, 14 FomulaSimplifications, 427 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 462 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 219 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 210 ConstructedInterpolants, 3 QuantifiedInterpolants, 33264 SizeOfPredicates, 5 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 329/378 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...