./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 15:56:48,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 15:56:48,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 15:56:48,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 15:56:48,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 15:56:48,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 15:56:48,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 15:56:48,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 15:56:48,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 15:56:48,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 15:56:48,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 15:56:48,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 15:56:48,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 15:56:48,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 15:56:48,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 15:56:48,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 15:56:48,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 15:56:48,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 15:56:48,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 15:56:48,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 15:56:48,302 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 15:56:48,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 15:56:48,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 15:56:48,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 15:56:48,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 15:56:48,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 15:56:48,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 15:56:48,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 15:56:48,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 15:56:48,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 15:56:48,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 15:56:48,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 15:56:48,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 15:56:48,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 15:56:48,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 15:56:48,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 15:56:48,308 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 15:56:48,316 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 15:56:48,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 15:56:48,317 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 15:56:48,317 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 15:56:48,317 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 15:56:48,318 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 15:56:48,318 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 15:56:48,318 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 15:56:48,318 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 15:56:48,318 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 15:56:48,318 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 15:56:48,318 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 15:56:48,319 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 15:56:48,319 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 15:56:48,319 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 15:56:48,319 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 15:56:48,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 15:56:48,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 15:56:48,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 15:56:48,320 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 15:56:48,320 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 15:56:48,320 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 15:56:48,320 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 15:56:48,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 15:56:48,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 15:56:48,321 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 15:56:48,321 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 15:56:48,321 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 15:56:48,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 15:56:48,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 15:56:48,321 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 15:56:48,322 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 15:56:48,322 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 15:56:48,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 15:56:48,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 15:56:48,322 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 15:56:48,322 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_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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 -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 [2018-12-08 15:56:48,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 15:56:48,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 15:56:48,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 15:56:48,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 15:56:48,349 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 15:56:48,350 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-12-08 15:56:48,383 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/data/74a27d37a/f679d12aa22f4dd5832ab0517b39eea0/FLAG8640649ed [2018-12-08 15:56:48,760 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 15:56:48,761 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-12-08 15:56:48,764 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/data/74a27d37a/f679d12aa22f4dd5832ab0517b39eea0/FLAG8640649ed [2018-12-08 15:56:48,772 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/data/74a27d37a/f679d12aa22f4dd5832ab0517b39eea0 [2018-12-08 15:56:48,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 15:56:48,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 15:56:48,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 15:56:48,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 15:56:48,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 15:56:48,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e0d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48, skipping insertion in model container [2018-12-08 15:56:48,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 15:56:48,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 15:56:48,875 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:56:48,877 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 15:56:48,887 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:56:48,895 INFO L195 MainTranslator]: Completed translation [2018-12-08 15:56:48,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48 WrapperNode [2018-12-08 15:56:48,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 15:56:48,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 15:56:48,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 15:56:48,896 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 15:56:48,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 15:56:48,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 15:56:48,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 15:56:48,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 15:56:48,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... [2018-12-08 15:56:48,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 15:56:48,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 15:56:48,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 15:56:48,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 15:56:48,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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-12-08 15:56:48,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 15:56:48,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 15:56:48,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 15:56:48,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 15:56:48,984 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 15:56:48,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 15:56:48,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 15:56:48,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 15:56:49,081 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 15:56:49,081 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 15:56:49,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:56:49 BoogieIcfgContainer [2018-12-08 15:56:49,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 15:56:49,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 15:56:49,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 15:56:49,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 15:56:49,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 03:56:48" (1/3) ... [2018-12-08 15:56:49,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1fa3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:56:49, skipping insertion in model container [2018-12-08 15:56:49,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:56:48" (2/3) ... [2018-12-08 15:56:49,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1fa3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:56:49, skipping insertion in model container [2018-12-08 15:56:49,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:56:49" (3/3) ... [2018-12-08 15:56:49,086 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-12-08 15:56:49,093 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 15:56:49,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 15:56:49,107 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 15:56:49,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 15:56:49,126 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 15:56:49,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 15:56:49,126 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 15:56:49,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 15:56:49,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 15:56:49,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 15:56:49,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 15:56:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-12-08 15:56:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 15:56:49,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:49,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:49,142 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:49,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash -584482135, now seen corresponding path program 1 times [2018-12-08 15:56:49,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:56:49,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:56:49,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 15:56:49,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:56:49,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 15:56:49,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 15:56:49,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 15:56:49,225 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-12-08 15:56:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:49,239 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2018-12-08 15:56:49,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 15:56:49,240 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-12-08 15:56:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:49,245 INFO L225 Difference]: With dead ends: 61 [2018-12-08 15:56:49,245 INFO L226 Difference]: Without dead ends: 29 [2018-12-08 15:56:49,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 15:56:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-08 15:56:49,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-08 15:56:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-08 15:56:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-12-08 15:56:49,269 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2018-12-08 15:56:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:49,270 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-12-08 15:56:49,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 15:56:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-12-08 15:56:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 15:56:49,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:49,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:49,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:49,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1528524609, now seen corresponding path program 1 times [2018-12-08 15:56:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:56:49,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:56:49,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 15:56:49,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:56:49,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:56:49,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:56:49,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 15:56:49,317 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-12-08 15:56:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:49,368 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-12-08 15:56:49,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:56:49,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-08 15:56:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:49,368 INFO L225 Difference]: With dead ends: 35 [2018-12-08 15:56:49,369 INFO L226 Difference]: Without dead ends: 33 [2018-12-08 15:56:49,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:56:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-08 15:56:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-08 15:56:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 15:56:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-12-08 15:56:49,374 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2018-12-08 15:56:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:49,374 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-12-08 15:56:49,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:56:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-12-08 15:56:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 15:56:49,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:49,375 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:49,375 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:49,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash -552299140, now seen corresponding path program 1 times [2018-12-08 15:56:49,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:56:49,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:49,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:56:49,427 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-08 15:56:49,428 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [28], [31], [58], [61], [63], [66], [68], [69], [70], [71], [81], [82], [83] [2018-12-08 15:56:49,449 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:56:49,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:56:49,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:56:49,524 INFO L272 AbstractInterpreter]: Visited 19 different actions 24 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 4. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 8 variables. [2018-12-08 15:56:49,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:49,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:56:49,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:49,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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-12-08 15:56:49,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:49,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:56:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:49,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:56:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:56:49,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:56:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:56:49,625 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:56:49,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 13 [2018-12-08 15:56:49,626 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:56:49,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:56:49,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:56:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:56:49,626 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2018-12-08 15:56:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:49,683 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-12-08 15:56:49,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:56:49,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-08 15:56:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:49,684 INFO L225 Difference]: With dead ends: 48 [2018-12-08 15:56:49,684 INFO L226 Difference]: Without dead ends: 46 [2018-12-08 15:56:49,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-08 15:56:49,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-08 15:56:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-08 15:56:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 15:56:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-12-08 15:56:49,690 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2018-12-08 15:56:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:49,690 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-12-08 15:56:49,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:56:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-12-08 15:56:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 15:56:49,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:49,691 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:49,691 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:49,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash -641752059, now seen corresponding path program 1 times [2018-12-08 15:56:49,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 15:56:49,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:49,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:56:49,741 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-08 15:56:49,741 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [28], [33], [38], [41], [43], [58], [61], [63], [66], [68], [69], [70], [71], [73], [74], [75], [76], [77] [2018-12-08 15:56:49,742 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:56:49,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:56:49,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:56:49,760 INFO L272 AbstractInterpreter]: Visited 24 different actions 34 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 4. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 10 variables. [2018-12-08 15:56:49,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:49,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:56:49,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:49,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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-12-08 15:56:49,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:49,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:56:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:49,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:56:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 15:56:49,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:56:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 15:56:49,831 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:56:49,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 11 [2018-12-08 15:56:49,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:56:49,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:56:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:56:49,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-08 15:56:49,832 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2018-12-08 15:56:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:49,882 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-12-08 15:56:49,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:56:49,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 15:56:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:49,884 INFO L225 Difference]: With dead ends: 55 [2018-12-08 15:56:49,884 INFO L226 Difference]: Without dead ends: 53 [2018-12-08 15:56:49,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-08 15:56:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-08 15:56:49,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-12-08 15:56:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-08 15:56:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-12-08 15:56:49,891 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2018-12-08 15:56:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:49,891 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-12-08 15:56:49,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:56:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-12-08 15:56:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 15:56:49,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:49,892 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:49,892 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:49,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash 7477945, now seen corresponding path program 1 times [2018-12-08 15:56:49,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:49,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:56:49,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:49,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:56:49,945 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-08 15:56:49,945 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [28], [31], [51], [58], [61], [63], [66], [68], [69], [70], [71], [81], [82], [83], [84], [85], [86], [87] [2018-12-08 15:56:49,947 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:56:49,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:56:49,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:56:49,972 INFO L272 AbstractInterpreter]: Visited 24 different actions 39 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 4. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 9 variables. [2018-12-08 15:56:49,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:49,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:56:49,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:49,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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-12-08 15:56:49,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:49,981 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:56:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:49,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:56:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 15:56:50,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:56:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 15:56:50,065 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:56:50,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 13 [2018-12-08 15:56:50,066 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:56:50,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 15:56:50,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 15:56:50,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:56:50,067 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2018-12-08 15:56:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:50,131 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2018-12-08 15:56:50,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:56:50,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-12-08 15:56:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:50,132 INFO L225 Difference]: With dead ends: 70 [2018-12-08 15:56:50,132 INFO L226 Difference]: Without dead ends: 63 [2018-12-08 15:56:50,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-08 15:56:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-08 15:56:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-12-08 15:56:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-08 15:56:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2018-12-08 15:56:50,138 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2018-12-08 15:56:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:50,138 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2018-12-08 15:56:50,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 15:56:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-12-08 15:56:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 15:56:50,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:50,139 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:50,139 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:50,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1583771254, now seen corresponding path program 1 times [2018-12-08 15:56:50,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:50,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:50,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:50,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:50,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:56:50,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:50,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:56:50,212 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-12-08 15:56:50,212 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [28], [33], [38], [41], [43], [58], [61], [63], [66], [68], [69], [70], [71], [73], [74], [75], [76], [77], [78], [79] [2018-12-08 15:56:50,213 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:56:50,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:56:50,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:56:50,230 INFO L272 AbstractInterpreter]: Visited 26 different actions 41 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 4. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 10 variables. [2018-12-08 15:56:50,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:50,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:56:50,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:50,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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-12-08 15:56:50,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:50,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:56:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:50,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:56:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 15:56:50,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:56:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 15:56:50,368 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:56:50,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [10] total 17 [2018-12-08 15:56:50,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:56:50,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:56:50,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:56:50,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-08 15:56:50,369 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2018-12-08 15:56:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:50,443 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2018-12-08 15:56:50,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 15:56:50,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-08 15:56:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:50,444 INFO L225 Difference]: With dead ends: 72 [2018-12-08 15:56:50,444 INFO L226 Difference]: Without dead ends: 70 [2018-12-08 15:56:50,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-12-08 15:56:50,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-08 15:56:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-12-08 15:56:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-08 15:56:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-12-08 15:56:50,450 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2018-12-08 15:56:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:50,450 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-12-08 15:56:50,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:56:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-12-08 15:56:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 15:56:50,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:50,451 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:50,451 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:50,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:50,451 INFO L82 PathProgramCache]: Analyzing trace with hash 199583202, now seen corresponding path program 1 times [2018-12-08 15:56:50,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:50,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:50,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-08 15:56:50,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:50,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:56:50,550 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-12-08 15:56:50,550 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [28], [31], [33], [38], [41], [43], [51], [58], [61], [63], [66], [68], [69], [70], [71], [73], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87] [2018-12-08 15:56:50,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:56:50,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:56:50,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:56:50,624 INFO L272 AbstractInterpreter]: Visited 36 different actions 195 times. Merged at 14 different actions 28 times. Never widened. Performed 300 root evaluator evaluations with a maximum evaluation depth of 4. Performed 300 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2018-12-08 15:56:50,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:50,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:56:50,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:50,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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-12-08 15:56:50,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:50,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:56:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:50,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:56:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 15:56:50,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:56:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 15:56:50,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:56:50,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-08 15:56:50,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:56:50,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 15:56:50,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 15:56:50,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-12-08 15:56:50,890 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 18 states. [2018-12-08 15:56:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:51,219 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2018-12-08 15:56:51,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 15:56:51,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-12-08 15:56:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:51,221 INFO L225 Difference]: With dead ends: 103 [2018-12-08 15:56:51,221 INFO L226 Difference]: Without dead ends: 91 [2018-12-08 15:56:51,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-12-08 15:56:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-08 15:56:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-08 15:56:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 15:56:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2018-12-08 15:56:51,232 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 56 [2018-12-08 15:56:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:51,232 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2018-12-08 15:56:51,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 15:56:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2018-12-08 15:56:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 15:56:51,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:51,233 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:51,234 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:51,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1513329503, now seen corresponding path program 1 times [2018-12-08 15:56:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:51,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:51,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 15:56:51,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:51,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:56:51,307 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-08 15:56:51,307 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [28], [33], [38], [41], [43], [58], [61], [63], [66], [68], [69], [70], [71], [73], [74], [75], [76], [77], [78], [79], [80] [2018-12-08 15:56:51,308 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:56:51,308 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:56:51,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:56:51,343 INFO L272 AbstractInterpreter]: Visited 27 different actions 108 times. Merged at 9 different actions 18 times. Never widened. Performed 180 root evaluator evaluations with a maximum evaluation depth of 4. Performed 180 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2018-12-08 15:56:51,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:51,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:56:51,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:51,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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-12-08 15:56:51,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:51,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:56:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:51,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:56:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-08 15:56:51,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:56:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-08 15:56:51,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:56:51,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2018-12-08 15:56:51,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:56:51,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 15:56:51,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 15:56:51,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-12-08 15:56:51,494 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 16 states. [2018-12-08 15:56:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:51,657 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2018-12-08 15:56:51,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 15:56:51,658 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-12-08 15:56:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:51,658 INFO L225 Difference]: With dead ends: 101 [2018-12-08 15:56:51,658 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 15:56:51,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-12-08 15:56:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 15:56:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-08 15:56:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 15:56:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2018-12-08 15:56:51,665 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 58 [2018-12-08 15:56:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:51,665 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2018-12-08 15:56:51,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 15:56:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2018-12-08 15:56:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 15:56:51,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:51,666 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:51,666 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:51,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1920756074, now seen corresponding path program 2 times [2018-12-08 15:56:51,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:51,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:51,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:56:51,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:51,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-12-08 15:56:51,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:51,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:56:51,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:56:51,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:56:51,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:51,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/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-12-08 15:56:51,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:56:51,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:56:51,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-08 15:56:51,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:56:51,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:56:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-08 15:56:51,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:56:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-08 15:56:52,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:56:52,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 30 [2018-12-08 15:56:52,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:56:52,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 15:56:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 15:56:52,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2018-12-08 15:56:52,165 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand 21 states. [2018-12-08 15:56:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:52,583 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2018-12-08 15:56:52,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 15:56:52,583 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-12-08 15:56:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:52,584 INFO L225 Difference]: With dead ends: 110 [2018-12-08 15:56:52,584 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 15:56:52,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=439, Invalid=1631, Unknown=0, NotChecked=0, Total=2070 [2018-12-08 15:56:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 15:56:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2018-12-08 15:56:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 15:56:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-12-08 15:56:52,595 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 83 [2018-12-08 15:56:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:52,595 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-12-08 15:56:52,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 15:56:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-12-08 15:56:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 15:56:52,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:56:52,597 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:56:52,597 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:56:52,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:56:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash -357754430, now seen corresponding path program 2 times [2018-12-08 15:56:52,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:56:52,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:52,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:56:52,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:56:52,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:56:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:56:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 64 proven. 75 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-12-08 15:56:52,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:52,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:56:52,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:56:52,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:56:52,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:56:52,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:56:52,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:56:52,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:56:52,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 15:56:52,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:56:52,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:56:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 100 proven. 26 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-12-08 15:56:52,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:56:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 100 proven. 26 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-12-08 15:56:52,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:56:52,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 21 [2018-12-08 15:56:52,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:56:52,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 15:56:52,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 15:56:52,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-08 15:56:52,962 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 17 states. [2018-12-08 15:56:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:56:53,161 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-12-08 15:56:53,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 15:56:53,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2018-12-08 15:56:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:56:53,161 INFO L225 Difference]: With dead ends: 103 [2018-12-08 15:56:53,161 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 15:56:53,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 201 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-12-08 15:56:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 15:56:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 15:56:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 15:56:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 15:56:53,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-12-08 15:56:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:56:53,162 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 15:56:53,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 15:56:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 15:56:53,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 15:56:53,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 15:56:53,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 15:56:53,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 15:56:53,598 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 15:56:53,599 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 15:56:53,599 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 15:56:53,599 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 15:56:53,599 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 15:56:53,599 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 15:56:53,599 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse1 (+ main_~buflim~0 2))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) (<= 1 main_~in~0) .cse2 (<= 0 main_~buf~0) (<= .cse1 main_~bufferlen~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse2 (= main_~bufferlen~0 .cse1) (= main_~buf~0 0)))) [2018-12-08 15:56:53,599 INFO L444 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse1 (+ main_~buflim~0 2))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) (<= 1 main_~in~0) .cse2 (<= 0 main_~buf~0) (<= .cse1 main_~bufferlen~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse2 (= main_~bufferlen~0 .cse1) (= main_~buf~0 0)))) [2018-12-08 15:56:53,599 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-12-08 15:56:53,599 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-12-08 15:56:53,599 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (and (<= main_~buf~0 2) .cse1 .cse0 (<= 3 main_~inlen~0) .cse2) (let ((.cse3 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse3) .cse1 .cse0 (<= .cse3 main_~bufferlen~0) .cse2)))) [2018-12-08 15:56:53,599 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-12-08 15:56:53,600 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-12-08 15:56:53,600 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0))) [2018-12-08 15:56:53,600 INFO L444 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0))) [2018-12-08 15:56:53,600 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-08 15:56:53,600 INFO L451 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-12-08 15:56:53,600 INFO L444 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= .cse3 main_~bufferlen~0))) (or (and .cse0 .cse1 (<= 0 main_~in~0) .cse2 (<= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 1 main_~in~0) (<= 0 main_~buf~0) .cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0))))) [2018-12-08 15:56:53,600 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-12-08 15:56:53,600 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-12-08 15:56:53,600 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-12-08 15:56:53,600 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-12-08 15:56:53,600 INFO L444 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-12-08 15:56:53,600 INFO L444 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-12-08 15:56:53,601 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-12-08 15:56:53,601 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-12-08 15:56:53,601 INFO L448 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-12-08 15:56:53,601 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-08 15:56:53,601 INFO L444 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (and (<= main_~buf~0 2) .cse1 .cse0 (<= 3 main_~inlen~0) .cse2) (let ((.cse3 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse3) .cse1 .cse0 (<= .cse3 main_~bufferlen~0) .cse2)))) [2018-12-08 15:56:53,601 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-12-08 15:56:53,601 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-12-08 15:56:53,601 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-12-08 15:56:53,601 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-12-08 15:56:53,601 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-12-08 15:56:53,601 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-12-08 15:56:53,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 03:56:53 BoogieIcfgContainer [2018-12-08 15:56:53,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 15:56:53,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 15:56:53,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 15:56:53,610 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 15:56:53,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:56:49" (3/4) ... [2018-12-08 15:56:53,612 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 15:56:53,615 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 15:56:53,616 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 15:56:53,616 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-08 15:56:53,618 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-08 15:56:53,618 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-08 15:56:53,618 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 15:56:53,644 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a4f2f339-1573-43f2-aa8f-68d2f5beb4e1/bin-2019/utaipan/witness.graphml [2018-12-08 15:56:53,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 15:56:53,645 INFO L168 Benchmark]: Toolchain (without parser) took 4871.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 957.7 MB in the beginning and 847.9 MB in the end (delta: 109.8 MB). Peak memory consumption was 427.0 MB. Max. memory is 11.5 GB. [2018-12-08 15:56:53,646 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:56:53,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 120.37 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 15:56:53,646 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.97 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:56:53,646 INFO L168 Benchmark]: Boogie Preprocessor took 12.94 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 15:56:53,646 INFO L168 Benchmark]: RCFGBuilder took 161.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-08 15:56:53,647 INFO L168 Benchmark]: TraceAbstraction took 4526.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 847.9 MB in the end (delta: 259.1 MB). Peak memory consumption was 442.6 MB. Max. memory is 11.5 GB. [2018-12-08 15:56:53,647 INFO L168 Benchmark]: Witness Printer took 35.03 ms. Allocated memory is still 1.3 GB. Free memory is still 847.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:56:53,648 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 120.37 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 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 11.97 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.94 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 161.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4526.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 847.9 MB in the end (delta: 259.1 MB). Peak memory consumption was 442.6 MB. Max. memory is 11.5 GB. * Witness Printer took 35.03 ms. Allocated memory is still 1.3 GB. Free memory is still 847.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((bufferlen + 1 <= inlen && bufferlen <= buflim + 2) && 0 <= in) && buflim + 2 <= bufferlen) && in <= 0) && buf == 0) && 2 <= bufferlen) || ((((((bufferlen + 1 <= inlen && in + bufferlen + 1 <= buf + inlen) && bufferlen <= buflim + 2) && 1 <= in) && 0 <= buf) && buflim + 2 <= bufferlen) && buf + 2 <= bufferlen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 10 OverallIterations, 16 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 359 SDtfs, 372 SDslu, 1472 SDs, 0 SdLazy, 1608 SolverSat, 428 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 973 GetRequests, 759 SyntacticMatches, 37 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 58 PreInvPairs, 100 NumberOfFragments, 466 HoareAnnotationTreeSize, 58 FomulaSimplifications, 814 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1244 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 859 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1248 ConstructedInterpolants, 0 QuantifiedInterpolants, 371723 SizeOfPredicates, 39 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 2641/3015 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...