./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 11:55:44,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:55:44,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:55:44,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:55:44,409 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:55:44,410 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:55:44,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:55:44,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:55:44,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:55:44,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:55:44,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:55:44,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:55:44,414 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:55:44,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:55:44,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:55:44,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:55:44,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:55:44,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:55:44,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:55:44,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:55:44,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:55:44,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:55:44,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:55:44,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:55:44,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:55:44,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:55:44,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:55:44,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:55:44,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:55:44,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:55:44,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:55:44,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:55:44,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:55:44,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:55:44,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:55:44,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:55:44,429 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 11:55:44,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:55:44,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:55:44,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:55:44,441 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:55:44,441 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 11:55:44,441 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 11:55:44,441 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 11:55:44,441 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 11:55:44,442 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 11:55:44,442 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 11:55:44,442 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 11:55:44,442 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 11:55:44,442 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 11:55:44,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:55:44,443 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:55:44,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:55:44,443 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:55:44,443 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:55:44,443 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:55:44,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:55:44,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:55:44,444 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:55:44,444 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:55:44,444 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:55:44,444 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:55:44,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:55:44,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:55:44,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:55:44,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:55:44,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:44,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:55:44,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:55:44,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:55:44,446 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 11:55:44,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:55:44,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:55:44,446 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:55:44,446 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_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2018-11-23 11:55:44,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:55:44,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:55:44,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:55:44,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:55:44,481 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:55:44,481 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-23 11:55:44,516 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/data/c03845db0/84a061f94cd142e498f23382fac868d0/FLAG2188835fb [2018-11-23 11:55:44,954 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:55:44,955 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-23 11:55:44,960 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/data/c03845db0/84a061f94cd142e498f23382fac868d0/FLAG2188835fb [2018-11-23 11:55:44,968 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/data/c03845db0/84a061f94cd142e498f23382fac868d0 [2018-11-23 11:55:44,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:55:44,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:55:44,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:44,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:55:44,973 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:55:44,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:44" (1/1) ... [2018-11-23 11:55:44,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e21522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:44, skipping insertion in model container [2018-11-23 11:55:44,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:44" (1/1) ... [2018-11-23 11:55:44,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:55:45,014 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:55:45,176 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:45,180 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:55:45,222 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:45,234 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:55:45,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45 WrapperNode [2018-11-23 11:55:45,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:45,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:45,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:55:45,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:55:45,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... [2018-11-23 11:55:45,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... [2018-11-23 11:55:45,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:45,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:55:45,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:55:45,305 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:55:45,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... [2018-11-23 11:55:45,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... [2018-11-23 11:55:45,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... [2018-11-23 11:55:45,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... [2018-11-23 11:55:45,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... [2018-11-23 11:55:45,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... [2018-11-23 11:55:45,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... [2018-11-23 11:55:45,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:55:45,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:55:45,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:55:45,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:55:45,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:55:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:55:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:55:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:55:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:55:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:55:45,951 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:45,951 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:55:45,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:45 BoogieIcfgContainer [2018-11-23 11:55:45,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:45,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:45,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:45,954 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:45,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:55:44" (1/3) ... [2018-11-23 11:55:45,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6705ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:45, skipping insertion in model container [2018-11-23 11:55:45,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:45" (2/3) ... [2018-11-23 11:55:45,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6705ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:45, skipping insertion in model container [2018-11-23 11:55:45,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:45" (3/3) ... [2018-11-23 11:55:45,956 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-23 11:55:45,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:45,967 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:45,978 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:45,999 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:45,999 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:45,999 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:45,999 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:45,999 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:45,999 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:45,999 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:45,999 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-23 11:55:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:55:46,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:46,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:46,019 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:46,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:46,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1483071650, now seen corresponding path program 1 times [2018-11-23 11:55:46,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:46,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:46,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:46,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:46,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:55:46,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:46,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:55:46,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:55:46,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:46,123 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-11-23 11:55:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,147 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-11-23 11:55:46,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:55:46,148 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:55:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:46,156 INFO L225 Difference]: With dead ends: 222 [2018-11-23 11:55:46,156 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:55:46,159 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-11-23 11:55:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:55:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-23 11:55:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:55:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-11-23 11:55:46,188 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-11-23 11:55:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:46,188 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-11-23 11:55:46,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:55:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-11-23 11:55:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:55:46,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:46,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:46,190 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:46,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:46,190 INFO L82 PathProgramCache]: Analyzing trace with hash -736931587, now seen corresponding path program 1 times [2018-11-23 11:55:46,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:46,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:46,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:46,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:46,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:46,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:46,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:46,234 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-11-23 11:55:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,290 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-11-23 11:55:46,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:46,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:55:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:46,292 INFO L225 Difference]: With dead ends: 205 [2018-11-23 11:55:46,292 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:55:46,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:55:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-23 11:55:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 11:55:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-11-23 11:55:46,302 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-11-23 11:55:46,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:46,302 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-11-23 11:55:46,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-11-23 11:55:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:55:46,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:46,303 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:46,303 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:46,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:46,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1504395429, now seen corresponding path program 1 times [2018-11-23 11:55:46,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:46,755 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 39 [2018-11-23 11:55:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:46,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:46,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:55:46,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:46,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:55:46,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:55:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:46,760 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2018-11-23 11:55:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,975 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-11-23 11:55:46,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:46,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 11:55:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:46,976 INFO L225 Difference]: With dead ends: 209 [2018-11-23 11:55:46,976 INFO L226 Difference]: Without dead ends: 190 [2018-11-23 11:55:46,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-23 11:55:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-11-23 11:55:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-23 11:55:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-11-23 11:55:46,984 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-11-23 11:55:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:46,984 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-11-23 11:55:46,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:55:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-23 11:55:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:55:46,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:46,985 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-11-23 11:55:46,986 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:46,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:46,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2142865338, now seen corresponding path program 1 times [2018-11-23 11:55:46,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:46,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:46,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:47,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:47,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:47,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:47,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:47,031 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-11-23 11:55:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,059 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-11-23 11:55:47,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:47,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 11:55:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:47,060 INFO L225 Difference]: With dead ends: 297 [2018-11-23 11:55:47,060 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 11:55:47,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 11:55:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-23 11:55:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:55:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-11-23 11:55:47,066 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-11-23 11:55:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:47,066 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-11-23 11:55:47,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-11-23 11:55:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:55:47,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:47,067 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:47,067 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:47,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2011475352, now seen corresponding path program 1 times [2018-11-23 11:55:47,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:47,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:47,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:55:47,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:47,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:47,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:47,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:47,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:47,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:47,108 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-11-23 11:55:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,141 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-11-23 11:55:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:47,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 11:55:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:47,142 INFO L225 Difference]: With dead ends: 230 [2018-11-23 11:55:47,142 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 11:55:47,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 11:55:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-23 11:55:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 11:55:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-11-23 11:55:47,149 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-11-23 11:55:47,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:47,149 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-11-23 11:55:47,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-11-23 11:55:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:55:47,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:47,152 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:47,152 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:47,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1818456969, now seen corresponding path program 1 times [2018-11-23 11:55:47,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:47,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:47,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:47,220 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-23 11:55:47,221 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [232], [235], [238], [519], [522], [523], [524] [2018-11-23 11:55:47,244 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:47,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:47,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:47,541 INFO L272 AbstractInterpreter]: Visited 24 different actions 49 times. Merged at 17 different actions 21 times. Never widened. Performed 683 root evaluator evaluations with a maximum evaluation depth of 10. Performed 683 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-11-23 11:55:47,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:47,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:47,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:47,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:47,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:47,567 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:47,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:47,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:47,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:55:47,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-23 11:55:47,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:55:47,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:55:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:55:47,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:47,683 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-11-23 11:55:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,778 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-11-23 11:55:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:47,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 11:55:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:47,780 INFO L225 Difference]: With dead ends: 192 [2018-11-23 11:55:47,780 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 11:55:47,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 11:55:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-23 11:55:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-23 11:55:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-11-23 11:55:47,789 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-11-23 11:55:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:47,789 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-11-23 11:55:47,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:55:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-11-23 11:55:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:55:47,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:47,790 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:47,791 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:47,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash 549034740, now seen corresponding path program 1 times [2018-11-23 11:55:47,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:47,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:47,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,058 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 33 [2018-11-23 11:55:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:48,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:48,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:48,062 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-23 11:55:48,062 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [253], [519], [522], [523], [524] [2018-11-23 11:55:48,063 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:48,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:48,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:48,164 INFO L272 AbstractInterpreter]: Visited 25 different actions 51 times. Merged at 18 different actions 22 times. Never widened. Performed 721 root evaluator evaluations with a maximum evaluation depth of 10. Performed 721 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 3 different actions. Largest state had 40 variables. [2018-11-23 11:55:48,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:48,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:48,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:48,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:48,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:48,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:48,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:55:48,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:48,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2018-11-23 11:55:48,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:48,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:55:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:55:48,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:48,377 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 4 states. [2018-11-23 11:55:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:48,518 INFO L93 Difference]: Finished difference Result 289 states and 444 transitions. [2018-11-23 11:55:48,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:48,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 11:55:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:48,519 INFO L225 Difference]: With dead ends: 289 [2018-11-23 11:55:48,519 INFO L226 Difference]: Without dead ends: 280 [2018-11-23 11:55:48,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-23 11:55:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2018-11-23 11:55:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-23 11:55:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 408 transitions. [2018-11-23 11:55:48,530 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 408 transitions. Word has length 28 [2018-11-23 11:55:48,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:48,530 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 408 transitions. [2018-11-23 11:55:48,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:55:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 408 transitions. [2018-11-23 11:55:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:55:48,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:48,531 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 11:55:48,531 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:48,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:48,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1113591962, now seen corresponding path program 1 times [2018-11-23 11:55:48,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:48,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:48,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:55:48,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:48,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:48,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:48,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:48,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:48,578 INFO L87 Difference]: Start difference. First operand 262 states and 408 transitions. Second operand 3 states. [2018-11-23 11:55:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:48,596 INFO L93 Difference]: Finished difference Result 454 states and 703 transitions. [2018-11-23 11:55:48,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:48,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:55:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:48,597 INFO L225 Difference]: With dead ends: 454 [2018-11-23 11:55:48,597 INFO L226 Difference]: Without dead ends: 220 [2018-11-23 11:55:48,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-23 11:55:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2018-11-23 11:55:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-23 11:55:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 326 transitions. [2018-11-23 11:55:48,604 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 326 transitions. Word has length 29 [2018-11-23 11:55:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:48,604 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 326 transitions. [2018-11-23 11:55:48,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 326 transitions. [2018-11-23 11:55:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:55:48,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:48,605 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 11:55:48,605 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:48,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:48,605 INFO L82 PathProgramCache]: Analyzing trace with hash 454582667, now seen corresponding path program 1 times [2018-11-23 11:55:48,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:48,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:48,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:48,789 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-23 11:55:48,789 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [260], [275], [290], [293], [296], [299], [519], [522], [523], [524] [2018-11-23 11:55:48,790 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:48,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:48,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:48,839 INFO L272 AbstractInterpreter]: Visited 28 different actions 39 times. Merged at 7 different actions 8 times. Never widened. Performed 497 root evaluator evaluations with a maximum evaluation depth of 10. Performed 497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 3 fixpoints after 2 different actions. Largest state had 43 variables. [2018-11-23 11:55:48,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:48,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:48,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:48,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:48,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:48,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:55:48,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:55:48,965 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:55:48,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-23 11:55:48,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:48,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:48,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:48,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:48,966 INFO L87 Difference]: Start difference. First operand 218 states and 326 transitions. Second operand 3 states. [2018-11-23 11:55:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:48,976 INFO L93 Difference]: Finished difference Result 221 states and 328 transitions. [2018-11-23 11:55:48,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:48,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:55:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:48,977 INFO L225 Difference]: With dead ends: 221 [2018-11-23 11:55:48,978 INFO L226 Difference]: Without dead ends: 215 [2018-11-23 11:55:48,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-23 11:55:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-11-23 11:55:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-23 11:55:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 317 transitions. [2018-11-23 11:55:48,983 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 317 transitions. Word has length 31 [2018-11-23 11:55:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:48,984 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 317 transitions. [2018-11-23 11:55:48,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 317 transitions. [2018-11-23 11:55:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:55:48,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:48,985 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:48,985 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:48,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash 362155736, now seen corresponding path program 1 times [2018-11-23 11:55:48,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:55:49,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:49,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:49,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:49,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:49,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:49,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:49,009 INFO L87 Difference]: Start difference. First operand 214 states and 317 transitions. Second operand 3 states. [2018-11-23 11:55:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,031 INFO L93 Difference]: Finished difference Result 363 states and 541 transitions. [2018-11-23 11:55:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:49,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 11:55:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:49,033 INFO L225 Difference]: With dead ends: 363 [2018-11-23 11:55:49,033 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 11:55:49,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 11:55:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-23 11:55:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-23 11:55:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 257 transitions. [2018-11-23 11:55:49,037 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 257 transitions. Word has length 36 [2018-11-23 11:55:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:49,037 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 257 transitions. [2018-11-23 11:55:49,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2018-11-23 11:55:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:55:49,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:49,038 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 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] [2018-11-23 11:55:49,038 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:49,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1093179144, now seen corresponding path program 1 times [2018-11-23 11:55:49,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:55:49,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:49,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:49,116 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-23 11:55:49,117 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [328], [331], [334], [519], [522], [523], [524] [2018-11-23 11:55:49,118 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:49,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:49,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:49,242 INFO L272 AbstractInterpreter]: Visited 30 different actions 79 times. Merged at 23 different actions 41 times. Never widened. Performed 1029 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1029 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 9 fixpoints after 6 different actions. Largest state had 41 variables. [2018-11-23 11:55:49,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:49,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:49,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:49,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:49,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:49,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:55:49,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:55:49,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:55:49,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 11:55:49,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:55:49,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:49,428 INFO L87 Difference]: Start difference. First operand 175 states and 257 transitions. Second operand 5 states. [2018-11-23 11:55:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,479 INFO L93 Difference]: Finished difference Result 252 states and 370 transitions. [2018-11-23 11:55:49,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:49,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 11:55:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:49,480 INFO L225 Difference]: With dead ends: 252 [2018-11-23 11:55:49,480 INFO L226 Difference]: Without dead ends: 247 [2018-11-23 11:55:49,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-23 11:55:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 241. [2018-11-23 11:55:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-23 11:55:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 356 transitions. [2018-11-23 11:55:49,486 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 356 transitions. Word has length 37 [2018-11-23 11:55:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:49,486 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 356 transitions. [2018-11-23 11:55:49,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 356 transitions. [2018-11-23 11:55:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:55:49,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:49,486 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 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] [2018-11-23 11:55:49,487 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:49,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:49,487 INFO L82 PathProgramCache]: Analyzing trace with hash 939353414, now seen corresponding path program 1 times [2018-11-23 11:55:49,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:49,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:49,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:49,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:49,636 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-23 11:55:49,636 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [379], [519], [522], [523], [524] [2018-11-23 11:55:49,637 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:49,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:49,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:49,686 INFO L272 AbstractInterpreter]: Visited 33 different actions 44 times. Merged at 7 different actions 8 times. Never widened. Performed 539 root evaluator evaluations with a maximum evaluation depth of 10. Performed 539 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 3 different actions. Largest state had 44 variables. [2018-11-23 11:55:49,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:49,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:49,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:49,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:49,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:49,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:49,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:50,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:55:50,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-23 11:55:50,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:55:50,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:55:50,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:55:50,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:50,026 INFO L87 Difference]: Start difference. First operand 241 states and 356 transitions. Second operand 8 states. [2018-11-23 11:55:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,103 INFO L93 Difference]: Finished difference Result 251 states and 365 transitions. [2018-11-23 11:55:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:50,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 11:55:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:50,105 INFO L225 Difference]: With dead ends: 251 [2018-11-23 11:55:50,105 INFO L226 Difference]: Without dead ends: 249 [2018-11-23 11:55:50,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-23 11:55:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 242. [2018-11-23 11:55:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-23 11:55:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 357 transitions. [2018-11-23 11:55:50,111 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 357 transitions. Word has length 40 [2018-11-23 11:55:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:50,111 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 357 transitions. [2018-11-23 11:55:50,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:55:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2018-11-23 11:55:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:55:50,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:50,111 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 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] [2018-11-23 11:55:50,112 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:50,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash -819577482, now seen corresponding path program 1 times [2018-11-23 11:55:50,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:55:50,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:50,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:50,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:50,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:50,130 INFO L87 Difference]: Start difference. First operand 242 states and 357 transitions. Second operand 3 states. [2018-11-23 11:55:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,147 INFO L93 Difference]: Finished difference Result 422 states and 620 transitions. [2018-11-23 11:55:50,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:50,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-23 11:55:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:50,149 INFO L225 Difference]: With dead ends: 422 [2018-11-23 11:55:50,149 INFO L226 Difference]: Without dead ends: 226 [2018-11-23 11:55:50,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-23 11:55:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-11-23 11:55:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-23 11:55:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 320 transitions. [2018-11-23 11:55:50,154 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 320 transitions. Word has length 41 [2018-11-23 11:55:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:50,154 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 320 transitions. [2018-11-23 11:55:50,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 320 transitions. [2018-11-23 11:55:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:55:50,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:50,155 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 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] [2018-11-23 11:55:50,155 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:50,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash 711556807, now seen corresponding path program 1 times [2018-11-23 11:55:50,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:50,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:50,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 11:55:50,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:50,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:50,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:55:50,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:50,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:50,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:50,186 INFO L87 Difference]: Start difference. First operand 224 states and 320 transitions. Second operand 3 states. [2018-11-23 11:55:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,203 INFO L93 Difference]: Finished difference Result 305 states and 435 transitions. [2018-11-23 11:55:50,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:50,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-23 11:55:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:50,204 INFO L225 Difference]: With dead ends: 305 [2018-11-23 11:55:50,204 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 11:55:50,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 11:55:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-11-23 11:55:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:55:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 200 transitions. [2018-11-23 11:55:50,209 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 200 transitions. Word has length 50 [2018-11-23 11:55:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:50,209 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 200 transitions. [2018-11-23 11:55:50,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 200 transitions. [2018-11-23 11:55:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:55:50,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:50,210 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1] [2018-11-23 11:55:50,210 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:50,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash -370372205, now seen corresponding path program 1 times [2018-11-23 11:55:50,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:55:50,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:50,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:50,272 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-23 11:55:50,272 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [439], [442], [445], [519], [522], [523], [524] [2018-11-23 11:55:50,273 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:50,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:50,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:50,325 INFO L272 AbstractInterpreter]: Visited 39 different actions 50 times. Merged at 7 different actions 8 times. Never widened. Performed 571 root evaluator evaluations with a maximum evaluation depth of 10. Performed 571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 5 fixpoints after 4 different actions. Largest state had 46 variables. [2018-11-23 11:55:50,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:50,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:50,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:50,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:50,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:50,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:50,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:50,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:55:50,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-11-23 11:55:50,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:55:50,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:55:50,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:55:50,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:50,483 INFO L87 Difference]: Start difference. First operand 144 states and 200 transitions. Second operand 9 states. [2018-11-23 11:55:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,522 INFO L93 Difference]: Finished difference Result 187 states and 260 transitions. [2018-11-23 11:55:50,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:55:50,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-23 11:55:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:50,523 INFO L225 Difference]: With dead ends: 187 [2018-11-23 11:55:50,523 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 11:55:50,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 11:55:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2018-11-23 11:55:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 11:55:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 251 transitions. [2018-11-23 11:55:50,528 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 251 transitions. Word has length 51 [2018-11-23 11:55:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:50,528 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 251 transitions. [2018-11-23 11:55:50,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:55:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 251 transitions. [2018-11-23 11:55:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:55:50,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:50,529 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2018-11-23 11:55:50,529 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:50,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash -379328264, now seen corresponding path program 1 times [2018-11-23 11:55:50,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:50,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:50,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:52,876 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 194 DAG size of output: 36 [2018-11-23 11:55:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:52,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:52,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:52,886 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-23 11:55:52,887 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [47], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [522], [523], [524] [2018-11-23 11:55:52,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:52,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:53,103 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:53,103 INFO L272 AbstractInterpreter]: Visited 44 different actions 142 times. Merged at 35 different actions 84 times. Widened at 1 different actions 1 times. Performed 1741 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1741 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 17 fixpoints after 9 different actions. Largest state had 50 variables. [2018-11-23 11:55:53,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:53,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:53,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:53,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:53,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:53,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:53,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:53,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:55:53,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:55:53,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2018-11-23 11:55:53,723 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:55:53,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:53,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:53,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:55:53,723 INFO L87 Difference]: Start difference. First operand 180 states and 251 transitions. Second operand 11 states. [2018-11-23 11:55:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:53,954 INFO L93 Difference]: Finished difference Result 186 states and 257 transitions. [2018-11-23 11:55:53,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:53,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-11-23 11:55:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:53,956 INFO L225 Difference]: With dead ends: 186 [2018-11-23 11:55:53,956 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 11:55:53,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 11:55:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-11-23 11:55:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-23 11:55:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 252 transitions. [2018-11-23 11:55:53,962 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 252 transitions. Word has length 61 [2018-11-23 11:55:53,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:53,962 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 252 transitions. [2018-11-23 11:55:53,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 252 transitions. [2018-11-23 11:55:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:55:53,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:53,963 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 11:55:53,963 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:53,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash -784011109, now seen corresponding path program 1 times [2018-11-23 11:55:53,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:53,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:53,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:55:54,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:54,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:54,068 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-11-23 11:55:54,068 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [328], [331], [334], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [522], [523], [524] [2018-11-23 11:55:54,069 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:54,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:54,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:54,210 INFO L272 AbstractInterpreter]: Visited 46 different actions 111 times. Merged at 37 different actions 55 times. Never widened. Performed 1404 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1404 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-23 11:55:54,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:54,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:54,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:54,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/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-11-23 11:55:54,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:54,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:54,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:55:54,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 11:55:54,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:55:54,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2018-11-23 11:55:54,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:55:54,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:55:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:55:54,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:54,430 INFO L87 Difference]: Start difference. First operand 181 states and 252 transitions. Second operand 7 states. [2018-11-23 11:55:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:54,544 INFO L93 Difference]: Finished difference Result 223 states and 308 transitions. [2018-11-23 11:55:54,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:55:54,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-23 11:55:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:54,546 INFO L225 Difference]: With dead ends: 223 [2018-11-23 11:55:54,546 INFO L226 Difference]: Without dead ends: 220 [2018-11-23 11:55:54,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-23 11:55:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-11-23 11:55:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-23 11:55:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 302 transitions. [2018-11-23 11:55:54,553 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 302 transitions. Word has length 79 [2018-11-23 11:55:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:54,554 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 302 transitions. [2018-11-23 11:55:54,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:55:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 302 transitions. [2018-11-23 11:55:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 11:55:54,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:54,555 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 11:55:54,555 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:54,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:54,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1961279789, now seen corresponding path program 1 times [2018-11-23 11:55:54,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:54,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:54,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:55,037 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 40 [2018-11-23 11:55:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:55,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:55,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:55,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-11-23 11:55:55,050 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [379], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [522], [523], [524] [2018-11-23 11:55:55,051 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:55,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:55,188 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:55,189 INFO L272 AbstractInterpreter]: Visited 44 different actions 104 times. Merged at 35 different actions 50 times. Never widened. Performed 1455 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1455 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-23 11:55:55,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:55,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:55,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:55,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:55,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:55,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:55,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:55,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 11:55:55,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:55:55,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2018-11-23 11:55:55,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:55:55,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:55,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:55,771 INFO L87 Difference]: Start difference. First operand 217 states and 302 transitions. Second operand 11 states. [2018-11-23 11:55:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,912 INFO L93 Difference]: Finished difference Result 220 states and 305 transitions. [2018-11-23 11:55:55,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:55:55,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-11-23 11:55:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:55,914 INFO L225 Difference]: With dead ends: 220 [2018-11-23 11:55:55,914 INFO L226 Difference]: Without dead ends: 218 [2018-11-23 11:55:55,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-23 11:55:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-11-23 11:55:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-23 11:55:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 303 transitions. [2018-11-23 11:55:55,919 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 303 transitions. Word has length 82 [2018-11-23 11:55:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:55,920 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 303 transitions. [2018-11-23 11:55:55,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 303 transitions. [2018-11-23 11:55:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:55:55,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:55,920 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:55,921 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:55,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash -101241370, now seen corresponding path program 1 times [2018-11-23 11:55:55,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:55,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:55,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:55:56,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:56,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:56,026 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-11-23 11:55:56,026 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [439], [442], [445], [451], [466], [481], [496], [499], [502], [507], [519], [522], [523], [524] [2018-11-23 11:55:56,027 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:55:56,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:55:56,138 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:55:56,138 INFO L272 AbstractInterpreter]: Visited 46 different actions 111 times. Merged at 37 different actions 55 times. Never widened. Performed 1404 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1404 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-23 11:55:56,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:56,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:55:56,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:56,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:56,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:56,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:55:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:56,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:56,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:55:56,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:55:56,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 19 [2018-11-23 11:55:56,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:55:56,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:55:56,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:55:56,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:56,407 INFO L87 Difference]: Start difference. First operand 218 states and 303 transitions. Second operand 15 states. [2018-11-23 11:55:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:56,519 INFO L93 Difference]: Finished difference Result 261 states and 363 transitions. [2018-11-23 11:55:56,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:55:56,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-23 11:55:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:56,520 INFO L225 Difference]: With dead ends: 261 [2018-11-23 11:55:56,520 INFO L226 Difference]: Without dead ends: 257 [2018-11-23 11:55:56,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-23 11:55:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-11-23 11:55:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-23 11:55:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 354 transitions. [2018-11-23 11:55:56,526 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 354 transitions. Word has length 93 [2018-11-23 11:55:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:56,526 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 354 transitions. [2018-11-23 11:55:56,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:55:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 354 transitions. [2018-11-23 11:55:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:55:56,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:56,527 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:56,527 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:56,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:56,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1744733813, now seen corresponding path program 2 times [2018-11-23 11:55:56,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:55:56,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:56,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:56,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:56,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:55:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:56,961 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 39 [2018-11-23 11:55:57,150 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 36 [2018-11-23 11:55:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:57,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:57,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:55:57,165 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 11:55:57,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 11:55:57,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:57,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:57,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:57,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 11:55:57,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:55:57,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:57,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:55:57,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:55:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:55:57,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:55:57,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 23 [2018-11-23 11:55:57,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:55:57,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:55:57,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:55:57,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:55:57,970 INFO L87 Difference]: Start difference. First operand 254 states and 354 transitions. Second operand 19 states. [2018-11-23 11:55:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:58,531 INFO L93 Difference]: Finished difference Result 268 states and 369 transitions. [2018-11-23 11:55:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:55:58,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 103 [2018-11-23 11:55:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:58,531 INFO L225 Difference]: With dead ends: 268 [2018-11-23 11:55:58,532 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:55:58,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=1449, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:55:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:55:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:55:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:55:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:55:58,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-11-23 11:55:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:58,533 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:55:58,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:55:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:55:58,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:58,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:55:58,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:55:58,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:55:58,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:55:58,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:55:58,774 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2018-11-23 11:55:58,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:55:58,777 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:55:58,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:55:58,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:55:58,777 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:55:58,777 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:55:58,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:55:58,777 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-11-23 11:55:58,777 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-11-23 11:55:58,777 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-11-23 11:55:58,778 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-23 11:55:58,779 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L444 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-11-23 11:55:58,780 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-11-23 11:55:58,781 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L444 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse3 (<= main_~this_buffer_empty~0 1)) (.cse5 (<= 1 main_~this_buffer_empty~0)) (.cse7 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse4 (<= 0 (+ main_~P8~0 2147483648))) (.cse6 (<= main_~P8~0 2147483647)) (.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod (+ main_~this_expect~0 1) 2))))) .cse3 .cse4 .cse5 (= main_~q~0 4) .cse6) (and (= 0 (mod (+ main_~this_expect~0 1) 2)) .cse4 (= main_~q~0 3) .cse6 .cse0 .cse1) (and .cse7 (= main_~q~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse7 (<= 5 main_~q~0) .cse4 .cse6 .cse0 .cse1))) [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-11-23 11:55:58,782 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-23 11:55:58,783 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-23 11:55:58,784 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-11-23 11:55:58,784 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-11-23 11:55:58,784 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-11-23 11:55:58,784 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-11-23 11:55:58,784 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-23 11:55:58,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:55:58 BoogieIcfgContainer [2018-11-23 11:55:58,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:55:58,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:55:58,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:55:58,800 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:55:58,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:45" (3/4) ... [2018-11-23 11:55:58,803 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:55:58,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:55:58,808 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:55:58,814 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 11:55:58,814 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:55:58,839 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) [2018-11-23 11:55:58,846 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_77d1aef6-654d-4f0b-9eff-b04e89b83ab1/bin-2019/utaipan/witness.graphml [2018-11-23 11:55:58,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:55:58,846 INFO L168 Benchmark]: Toolchain (without parser) took 13875.98 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 521.1 MB). Free memory was 954.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 330.9 MB. Max. memory is 11.5 GB. [2018-11-23 11:55:58,847 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:55:58,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.01 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 929.5 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-23 11:55:58,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 929.5 MB in the beginning and 1.1 GB in the end (delta: -209.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-23 11:55:58,848 INFO L168 Benchmark]: Boogie Preprocessor took 37.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 11:55:58,848 INFO L168 Benchmark]: RCFGBuilder took 609.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:55:58,848 INFO L168 Benchmark]: TraceAbstraction took 12847.97 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 375.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -74.3 MB). Peak memory consumption was 301.6 MB. Max. memory is 11.5 GB. [2018-11-23 11:55:58,849 INFO L168 Benchmark]: Witness Printer took 45.78 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 536.7 kB). Peak memory consumption was 536.7 kB. Max. memory is 11.5 GB. [2018-11-23 11:55:58,851 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.01 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 929.5 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 929.5 MB in the beginning and 1.1 GB in the end (delta: -209.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 609.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12847.97 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 375.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -74.3 MB). Peak memory consumption was 301.6 MB. Max. memory is 11.5 GB. * Witness Printer took 45.78 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 536.7 kB). Peak memory consumption was 536.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-11-23 11:55:58,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 24]: Loop Invariant [2018-11-23 11:55:58,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-23 11:55:58,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && q == 4) && P8 <= 2147483647)) || (((((0 == (this_expect + 1) % 2 && 0 <= P8 + 2147483648) && q == 3) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && q == 1) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 12.7s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 3253 SDtfs, 2076 SDslu, 9865 SDs, 0 SdLazy, 1581 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1400 GetRequests, 1233 SyntacticMatches, 21 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 10 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 72 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 38 NumberOfFragments, 194 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1968 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 572 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1511 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2101 ConstructedInterpolants, 324 QuantifiedInterpolants, 1809542 SizeOfPredicates, 55 NumberOfNonLiveVariables, 4088 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 42 InterpolantComputations, 12 PerfectInterpolantSequences, 901/2194 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...