./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.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_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3de88212c8693b9f87e164f2a8585947c848ea21 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:55:45,951 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:55:45,952 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:55:45,960 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:55:45,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:55:45,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:55:45,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:55:45,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:55:45,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:55:45,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:55:45,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:55:45,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:55:45,966 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:55:45,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:55:45,968 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:55:45,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:55:45,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:55:45,970 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:55:45,971 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:55:45,972 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:55:45,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:55:45,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:55:45,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:55:45,975 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:55:45,975 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:55:45,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:55:45,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:55:45,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:55:45,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:55:45,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:55:45,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:55:45,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:55:45,979 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:55:45,979 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:55:45,980 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:55:45,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:55:45,981 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 07:55:45,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:55:45,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:55:45,991 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:55:45,991 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:55:45,991 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:55:45,991 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:55:45,991 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:55:45,992 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:55:45,992 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:55:45,992 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:55:45,992 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:55:45,993 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:55:45,993 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:55:45,993 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:55:45,993 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:55:45,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:55:45,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:55:45,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:55:45,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:55:45,994 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:55:45,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:55:45,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:55:45,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:55:45,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:55:45,994 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:55:45,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:55:45,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:55:45,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:55:45,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:55:45,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:55:45,995 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:55:45,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:55:45,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:55:45,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:55:45,996 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan 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 -> Taipan 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 -> 3de88212c8693b9f87e164f2a8585947c848ea21 [2018-11-10 07:55:46,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:55:46,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:55:46,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:55:46,034 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:55:46,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:55:46,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-10 07:55:46,081 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/data/92216b584/0150cdd1c13c4a1abd1603f3e5d131fe/FLAG3d75459f2 [2018-11-10 07:55:46,475 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:55:46,475 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-10 07:55:46,480 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/data/92216b584/0150cdd1c13c4a1abd1603f3e5d131fe/FLAG3d75459f2 [2018-11-10 07:55:46,489 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/data/92216b584/0150cdd1c13c4a1abd1603f3e5d131fe [2018-11-10 07:55:46,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:55:46,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:55:46,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:55:46,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:55:46,495 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:55:46,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac897aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46, skipping insertion in model container [2018-11-10 07:55:46,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:55:46,516 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:55:46,617 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:55:46,620 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:55:46,634 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:55:46,644 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:55:46,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46 WrapperNode [2018-11-10 07:55:46,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:55:46,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:55:46,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:55:46,645 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:55:46,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:55:46,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:55:46,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:55:46,659 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:55:46,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... [2018-11-10 07:55:46,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:55:46,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:55:46,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:55:46,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:55:46,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/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:55:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:55:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:55:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:55:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:55:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:55:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:55:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 07:55:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 07:55:46,921 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:55:46,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:55:46 BoogieIcfgContainer [2018-11-10 07:55:46,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:55:46,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:55:46,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:55:46,925 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:55:46,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:55:46" (1/3) ... [2018-11-10 07:55:46,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b674cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:55:46, skipping insertion in model container [2018-11-10 07:55:46,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:46" (2/3) ... [2018-11-10 07:55:46,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b674cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:55:46, skipping insertion in model container [2018-11-10 07:55:46,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:55:46" (3/3) ... [2018-11-10 07:55:46,928 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-10 07:55:46,936 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:55:46,943 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:55:46,957 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:55:46,983 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:55:46,983 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:55:46,983 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:55:46,984 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:55:46,984 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:55:46,984 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:55:46,984 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:55:46,984 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:55:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-10 07:55:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 07:55:47,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:55:47,004 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:55:47,006 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:55:47,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:55:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-11-10 07:55:47,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:55:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:47,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:55:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:47,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:55:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:47,088 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:55:47,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:55:47,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:55:47,089 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:55:47,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:55:47,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:55:47,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:55:47,102 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 07:55:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:55:47,118 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-10 07:55:47,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:55:47,119 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-10 07:55:47,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:55:47,124 INFO L225 Difference]: With dead ends: 39 [2018-11-10 07:55:47,124 INFO L226 Difference]: Without dead ends: 22 [2018-11-10 07:55:47,127 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:55:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-10 07:55:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 07:55:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 07:55:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-10 07:55:47,151 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-10 07:55:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:55:47,151 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-10 07:55:47,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:55:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-10 07:55:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 07:55:47,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:55:47,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:55:47,152 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:55:47,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:55:47,153 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-11-10 07:55:47,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:55:47,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:47,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:55:47,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:47,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:55:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:47,208 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:55:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:55:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:55:47,208 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:55:47,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:55:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:55:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:55:47,210 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-10 07:55:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:55:47,273 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-10 07:55:47,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:55:47,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 07:55:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:55:47,275 INFO L225 Difference]: With dead ends: 30 [2018-11-10 07:55:47,275 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 07:55:47,276 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:55:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 07:55:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-10 07:55:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 07:55:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-10 07:55:47,279 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-11-10 07:55:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:55:47,279 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-10 07:55:47,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:55:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-10 07:55:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:55:47,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:55:47,281 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:55:47,281 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:55:47,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:55:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-11-10 07:55:47,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:55:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:47,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:55:47,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:47,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:55:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:49,362 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-11-10 07:55:49,365 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:55:49,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:55:49,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:55:49,366 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:55:49,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:55:49,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:55:49,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:55:49,367 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-11-10 07:55:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:55:49,454 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-11-10 07:55:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:55:49,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:55:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:55:49,456 INFO L225 Difference]: With dead ends: 54 [2018-11-10 07:55:49,456 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 07:55:49,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:55:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 07:55:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 07:55:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 07:55:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-10 07:55:49,465 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-11-10 07:55:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:55:49,465 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-10 07:55:49,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:55:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-11-10 07:55:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:55:49,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:55:49,467 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:55:49,467 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:55:49,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:55:49,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-11-10 07:55:49,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:55:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:49,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:55:49,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:49,469 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:55:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:49,666 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-10 07:55:49,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:55:49,667 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:55:49,668 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-10 07:55:49,669 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [23], [29], [35], [41], [47], [53], [59], [65], [71], [80], [83], [85], [91], [92], [93], [95] [2018-11-10 07:55:49,708 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:55:49,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:55:49,780 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 07:55:50,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 07:55:50,217 INFO L272 AbstractInterpreter]: Visited 22 different actions 133 times. Merged at 13 different actions 89 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-10 07:55:50,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:55:50,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 07:55:50,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:55:50,232 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/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:55:50,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:55:50,241 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 07:55:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:50,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:55:50,289 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-10 07:55:50,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:55:52,580 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-10 07:55:52,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:55:52,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-10 07:55:52,599 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:55:52,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 07:55:52,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 07:55:52,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:55:52,600 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-11-10 07:55:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:55:52,733 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-10 07:55:52,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:55:52,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-10 07:55:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:55:52,737 INFO L225 Difference]: With dead ends: 54 [2018-11-10 07:55:52,737 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 07:55:52,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:55:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 07:55:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-10 07:55:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 07:55:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-10 07:55:52,742 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-11-10 07:55:52,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:55:52,742 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-10 07:55:52,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 07:55:52,742 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-10 07:55:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:55:52,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:55:52,743 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:55:52,743 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:55:52,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:55:52,743 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-11-10 07:55:52,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:55:52,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:52,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:55:52,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:52,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:55:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:52,781 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:55:52,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:55:52,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:55:52,781 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:55:52,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:55:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:55:52,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:55:52,782 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-11-10 07:55:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:55:52,833 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-10 07:55:52,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:55:52,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:55:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:55:52,835 INFO L225 Difference]: With dead ends: 66 [2018-11-10 07:55:52,835 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 07:55:52,835 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:55:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 07:55:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-10 07:55:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 07:55:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-10 07:55:52,841 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-11-10 07:55:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:55:52,841 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-10 07:55:52,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:55:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-10 07:55:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:55:52,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:55:52,842 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:55:52,842 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:55:52,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:55:52,843 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-11-10 07:55:52,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:55:52,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:52,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:55:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:55:52,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:55:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:55:54,974 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-10 07:56:07,071 WARN L179 SmtUtils]: Spent 12.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 17 [2018-11-10 07:56:21,176 WARN L179 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-11-10 07:56:23,185 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-10 07:56:25,198 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-10 07:56:27,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-11-10 07:56:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-10 07:56:27,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:27,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:56:27,236 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-10 07:56:27,237 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [25], [31], [37], [43], [49], [55], [61], [67], [73], [80], [83], [85], [91], [92], [93], [95] [2018-11-10 07:56:27,239 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:56:27,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:56:27,243 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 07:56:27,271 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 07:56:27,272 INFO L272 AbstractInterpreter]: Visited 22 different actions 25 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-10 07:56:27,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:27,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 07:56:27,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:27,276 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/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:56:27,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:27,288 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 07:56:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:27,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:27,418 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-10 07:56:27,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:56:27,532 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-10 07:56:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:56:27,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6] total 20 [2018-11-10 07:56:27,549 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:56:27,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 07:56:27,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:56:27,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=7, NotChecked=124, Total=380 [2018-11-10 07:56:27,550 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 16 states. [2018-11-10 07:56:29,615 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse15 (div c_main_~y~0 2))) (let ((.cse13 (* (- 2) .cse15)) (.cse9 (* 2 .cse15))) (let ((.cse14 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse11 (div (+ c_main_~y~0 .cse13) 4294967296))) (let ((.cse12 (* 4294967296 .cse11)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse14)) (.cse5 (<= .cse14 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse13 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 .cse12))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))) (<= (+ .cse9 .cse12 1) c_main_~y~0))))))) is different from false [2018-11-10 07:56:35,683 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse12 (* (- 2) .cse14))) (let ((.cse0 (* 2 .cse14)) (.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse11 (div (+ c_main_~y~0 .cse12) 4294967296))) (let ((.cse6 (* 4294967296 .cse11)) (.cse3 (<= .cse13 c_main_~y~0)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse13)) (.cse9 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296)) (.cse7 (or .cse2 .cse3)) (.cse8 (<= (+ .cse0 .cse6 1) c_main_~y~0))) (and (let ((.cse1 (* 4294967296 .cse9))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 .cse8))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse11) .cse7)) .cse8)))))) is different from false [2018-11-10 07:56:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:35,740 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-10 07:56:35,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:56:35,740 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-10 07:56:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:35,741 INFO L225 Difference]: With dead ends: 64 [2018-11-10 07:56:35,741 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 07:56:35,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=57, Invalid=230, Unknown=9, NotChecked=210, Total=506 [2018-11-10 07:56:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 07:56:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-10 07:56:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 07:56:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-10 07:56:35,745 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 23 [2018-11-10 07:56:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:35,746 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-10 07:56:35,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 07:56:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-10 07:56:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 07:56:35,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:35,748 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:35,749 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:35,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:35,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-11-10 07:56:35,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:56:35,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:35,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:35,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:35,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:56:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:35,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:35,984 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:56:35,984 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:56:35,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:56:35,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:35,984 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/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:56:35,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:56:35,989 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:56:36,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 07:56:36,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:56:36,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:36,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:56:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:44,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:56:44,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-10 07:56:44,452 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:56:44,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 07:56:44,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 07:56:44,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 07:56:44,453 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 23 states. [2018-11-10 07:56:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:44,723 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-10 07:56:44,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 07:56:44,723 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-11-10 07:56:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:44,724 INFO L225 Difference]: With dead ends: 77 [2018-11-10 07:56:44,724 INFO L226 Difference]: Without dead ends: 72 [2018-11-10 07:56:44,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 07:56:44,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-10 07:56:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-10 07:56:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 07:56:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-10 07:56:44,734 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 35 [2018-11-10 07:56:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:44,734 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-10 07:56:44,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 07:56:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-10 07:56:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 07:56:44,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:44,737 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:44,737 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:44,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1509590180, now seen corresponding path program 2 times [2018-11-10 07:56:44,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:56:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:44,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:56:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:44,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:56:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:44,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:44,847 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:56:44,848 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:56:44,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:56:44,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:44,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/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-10 07:56:44,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:56:44,857 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:56:44,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 07:56:44,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:56:44,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:44,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:56:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:45,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:56:45,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-10 07:56:45,142 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:56:45,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:56:45,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:56:45,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:56:45,142 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 8 states. [2018-11-10 07:56:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:45,215 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-10 07:56:45,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:56:45,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-10 07:56:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:45,216 INFO L225 Difference]: With dead ends: 76 [2018-11-10 07:56:45,216 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 07:56:45,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:56:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 07:56:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 07:56:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 07:56:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-10 07:56:45,219 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-11-10 07:56:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:45,219 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-10 07:56:45,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:56:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-10 07:56:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 07:56:45,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:45,220 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:45,220 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:45,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-11-10 07:56:45,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:56:45,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:45,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:56:45,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:45,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:56:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:45,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:45,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:56:45,632 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:56:45,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:56:45,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:45,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/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-10 07:56:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:56:45,638 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 07:56:45,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:56:45,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:56:45,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:45,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:57:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:57:00,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:57:00,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-10 07:57:00,868 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:57:00,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 07:57:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 07:57:00,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 07:57:00,869 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-11-10 07:57:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:57:01,255 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-10 07:57:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 07:57:01,256 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-10 07:57:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:57:01,256 INFO L225 Difference]: With dead ends: 66 [2018-11-10 07:57:01,256 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 07:57:01,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 07:57:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 07:57:01,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-10 07:57:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 07:57:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-10 07:57:01,261 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-11-10 07:57:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:57:01,261 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-10 07:57:01,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 07:57:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-10 07:57:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 07:57:01,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:57:01,262 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:57:01,262 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:57:01,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:57:01,263 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-11-10 07:57:01,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:57:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:57:01,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:57:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:57:01,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:57:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:57:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:57:01,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:57:01,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:57:01,907 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:57:01,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:57:01,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:57:01,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/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-10 07:57:01,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:57:01,912 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 07:57:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:57:01,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:57:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:57:01,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:57:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:57:24,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:57:24,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-10 07:57:24,383 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:57:24,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-10 07:57:24,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 07:57:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5621, Unknown=1, NotChecked=0, Total=6972 [2018-11-10 07:57:24,385 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-11-10 07:57:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:57:25,011 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-10 07:57:25,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-10 07:57:25,012 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-11-10 07:57:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:57:25,012 INFO L225 Difference]: With dead ends: 78 [2018-11-10 07:57:25,012 INFO L226 Difference]: Without dead ends: 73 [2018-11-10 07:57:25,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=1350, Invalid=5621, Unknown=1, NotChecked=0, Total=6972 [2018-11-10 07:57:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-10 07:57:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-10 07:57:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 07:57:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-10 07:57:25,016 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-11-10 07:57:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:57:25,016 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-10 07:57:25,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-10 07:57:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-10 07:57:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 07:57:25,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:57:25,017 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:57:25,017 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:57:25,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:57:25,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-11-10 07:57:25,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:57:25,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:57:25,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:57:25,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:57:25,018 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:57:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:57:27,285 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:31,468 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:33,523 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:35,572 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:39,627 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:41,677 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:45,769 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:47,826 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:49,900 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:52,092 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:54,221 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:56,358 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:57:58,434 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:00,581 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:02,825 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:04,913 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:07,004 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:09,089 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:11,176 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:13,272 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:15,361 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:19,649 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:23,860 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:25,962 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:28,073 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:30,192 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:34,314 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:38,429 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:40,537 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:44,668 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:46,801 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:48,927 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 07:58:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:49,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:58:49,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:58:49,249 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:58:49,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:58:49,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:58:49,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/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-10 07:58:49,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:58:49,256 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:58:54,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-10 07:58:54,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:58:54,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:58:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:58:57,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:59:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 07:59:06,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:59:06,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6] total 108 [2018-11-10 07:59:06,295 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:59:06,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-11-10 07:59:06,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-11-10 07:59:06,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=11142, Unknown=0, NotChecked=0, Total=11556 [2018-11-10 07:59:06,298 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 104 states. [2018-11-10 07:59:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:59:07,873 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-11-10 07:59:07,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-10 07:59:07,873 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 71 [2018-11-10 07:59:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:59:07,873 INFO L225 Difference]: With dead ends: 87 [2018-11-10 07:59:07,873 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:59:07,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 38 SyntacticMatches, 53 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 95.9s TimeCoverageRelationStatistics Valid=420, Invalid=11352, Unknown=0, NotChecked=0, Total=11772 [2018-11-10 07:59:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:59:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:59:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:59:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:59:07,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-11-10 07:59:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:59:07,876 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:59:07,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-11-10 07:59:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:59:07,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:59:07,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:59:10,007 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2018-11-10 07:59:10,019 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:59:10,019 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:59:10,019 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:59:10,019 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:59:10,019 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse2 (* 2 .cse5)) (.cse3 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse4 (+ .cse2 main_~x~0 .cse3)) (.cse0 (= (+ .cse2 .cse3) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (let ((.cse1 (+ main_~x~0 5))) (and (<= 0 .cse1) (<= .cse1 0) (<= (+ .cse2 .cse3 1) main_~y~0))) (and (<= .cse4 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (and (<= .cse4 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse0 (* 2 .cse3)) (.cse1 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (or (and (<= main_~y~0 (+ .cse0 .cse1)) (<= (+ .cse0 main_~x~0 .cse1) (+ main_~y~0 100)) (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse0 .cse1 1) main_~y~0)))))) [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-10 07:59:10,020 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-10 07:59:10,021 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-10 07:59:10,021 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-10 07:59:10,021 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-10 07:59:10,021 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-10 07:59:10,021 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-10 07:59:10,021 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-10 07:59:10,021 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-10 07:59:10,021 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-10 07:59:10,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:59:10 BoogieIcfgContainer [2018-11-10 07:59:10,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:59:10,033 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:59:10,033 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:59:10,033 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:59:10,034 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:55:46" (3/4) ... [2018-11-10 07:59:10,037 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:59:10,041 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:59:10,041 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:59:10,042 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 07:59:10,045 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 07:59:10,045 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 07:59:10,045 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:59:10,084 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f250b7c2-a9fc-4a7b-aa83-07c7dfed7483/bin-2019/utaipan/witness.graphml [2018-11-10 07:59:10,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:59:10,085 INFO L168 Benchmark]: Toolchain (without parser) took 203593.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -108.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:10,085 INFO L168 Benchmark]: CDTParser took 0.17 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-10 07:59:10,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.63 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:10,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.90 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:59:10,086 INFO L168 Benchmark]: Boogie Preprocessor took 16.56 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:10,086 INFO L168 Benchmark]: RCFGBuilder took 246.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:10,087 INFO L168 Benchmark]: TraceAbstraction took 203110.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.1 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:10,087 INFO L168 Benchmark]: Witness Printer took 50.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:59:10,090 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.17 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 151.63 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.90 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.56 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 203110.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.1 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. * Witness Printer took 50.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. 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: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) + 1 <= y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 203.0s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 27 SDslu, 2166 SDs, 0 SdLazy, 8411 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 379 SyntacticMatches, 69 SemanticMatches, 351 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 190.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 289 HoareAnnotationTreeSize, 18 FomulaSimplifications, 89 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 348 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 182.9s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 921 ConstructedInterpolants, 63 QuantifiedInterpolants, 502103 SizeOfPredicates, 11 NumberOfNonLiveVariables, 901 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 166/868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...