./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/vogal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/vogal-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/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 fb43643cd35c65185f84c332fba8bb38d564a0a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:57:36,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:57:36,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:57:36,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:57:36,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:57:36,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:57:36,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:57:36,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:57:36,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:57:36,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:57:36,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:57:36,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:57:36,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:57:36,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:57:36,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:57:36,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:57:36,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:57:36,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:57:36,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:57:36,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:57:36,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:57:36,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:57:36,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:57:36,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:57:36,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:57:36,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:57:36,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:57:36,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:57:36,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:57:36,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:57:36,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:57:36,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:57:36,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:57:36,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:57:36,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:57:36,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:57:36,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:57:36,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:57:36,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:57:36,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:57:36,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:57:36,583 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:57:36,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:57:36,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:57:36,597 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:57:36,597 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:57:36,597 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:57:36,597 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:57:36,597 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:57:36,598 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:57:36,598 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:57:36,598 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:57:36,598 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:57:36,598 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:57:36,599 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:57:36,599 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:57:36,599 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:57:36,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:57:36,600 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:57:36,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:57:36,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:57:36,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:57:36,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:57:36,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:57:36,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:57:36,601 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:57:36,601 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:57:36,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:57:36,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:57:36,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:57:36,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:57:36,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:57:36,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:57:36,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:57:36,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:57:36,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:57:36,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:57:36,603 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:57:36,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:57:36,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:57:36,603 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:57:36,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:57:36,604 INFO L138 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/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/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 -> fb43643cd35c65185f84c332fba8bb38d564a0a2 [2019-12-07 19:57:36,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:57:36,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:57:36,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:57:36,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:57:36,725 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:57:36,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/../../sv-benchmarks/c/loops/vogal-2.i [2019-12-07 19:57:36,763 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/data/1251ec6c4/eff8b5196c3a49c3bdfbd83bcdfd3aa4/FLAG8a4dee80d [2019-12-07 19:57:37,112 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:57:37,113 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/sv-benchmarks/c/loops/vogal-2.i [2019-12-07 19:57:37,117 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/data/1251ec6c4/eff8b5196c3a49c3bdfbd83bcdfd3aa4/FLAG8a4dee80d [2019-12-07 19:57:37,125 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/data/1251ec6c4/eff8b5196c3a49c3bdfbd83bcdfd3aa4 [2019-12-07 19:57:37,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:57:37,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:57:37,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:57:37,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:57:37,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:57:37,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d97e079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37, skipping insertion in model container [2019-12-07 19:57:37,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:57:37,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:57:37,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:57:37,289 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:57:37,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:57:37,318 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:57:37,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37 WrapperNode [2019-12-07 19:57:37,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:57:37,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:57:37,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:57:37,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:57:37,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:57:37,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:57:37,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:57:37,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:57:37,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... [2019-12-07 19:57:37,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:57:37,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:57:37,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:57:37,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:57:37,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/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 [2019-12-07 19:57:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:57:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:57:37,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:57:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 19:57:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 19:57:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:57:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:57:37,648 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:57:37,649 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-12-07 19:57:37,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:57:37 BoogieIcfgContainer [2019-12-07 19:57:37,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:57:37,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:57:37,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:57:37,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:57:37,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:57:37" (1/3) ... [2019-12-07 19:57:37,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29df1a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:57:37, skipping insertion in model container [2019-12-07 19:57:37,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:57:37" (2/3) ... [2019-12-07 19:57:37,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29df1a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:57:37, skipping insertion in model container [2019-12-07 19:57:37,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:57:37" (3/3) ... [2019-12-07 19:57:37,656 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-2.i [2019-12-07 19:57:37,662 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:57:37,667 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:57:37,674 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:57:37,690 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:57:37,690 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:57:37,690 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:57:37,691 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:57:37,691 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:57:37,691 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:57:37,691 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:57:37,691 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:57:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-12-07 19:57:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:57:37,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:37,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:37,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:37,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1529699898, now seen corresponding path program 1 times [2019-12-07 19:57:37,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:37,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660688875] [2019-12-07 19:57:37,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:57:37,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660688875] [2019-12-07 19:57:37,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:37,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:57:37,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444039239] [2019-12-07 19:57:37,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 19:57:37,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:37,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 19:57:37,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 19:57:37,826 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2019-12-07 19:57:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:37,837 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2019-12-07 19:57:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 19:57:37,838 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-12-07 19:57:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:37,843 INFO L225 Difference]: With dead ends: 28 [2019-12-07 19:57:37,844 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 19:57:37,846 INFO L630 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 [2019-12-07 19:57:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 19:57:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 19:57:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 19:57:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-12-07 19:57:37,866 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2019-12-07 19:57:37,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:37,866 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 19:57:37,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 19:57:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-12-07 19:57:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:57:37,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:37,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:37,867 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:37,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:37,867 INFO L82 PathProgramCache]: Analyzing trace with hash 708827924, now seen corresponding path program 1 times [2019-12-07 19:57:37,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:37,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351145985] [2019-12-07 19:57:37,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:57:37,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351145985] [2019-12-07 19:57:37,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:57:37,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:57:37,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912448270] [2019-12-07 19:57:37,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:57:37,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:37,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:57:37,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:57:37,916 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 3 states. [2019-12-07 19:57:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:37,946 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-12-07 19:57:37,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:57:37,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 19:57:37,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:37,947 INFO L225 Difference]: With dead ends: 36 [2019-12-07 19:57:37,947 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 19:57:37,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:57:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 19:57:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2019-12-07 19:57:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 19:57:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-12-07 19:57:37,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2019-12-07 19:57:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:37,951 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-12-07 19:57:37,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:57:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2019-12-07 19:57:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 19:57:37,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:37,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:37,952 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:37,952 INFO L82 PathProgramCache]: Analyzing trace with hash -325494678, now seen corresponding path program 1 times [2019-12-07 19:57:37,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:37,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578243440] [2019-12-07 19:57:37,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:57:38,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578243440] [2019-12-07 19:57:38,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690716844] [2019-12-07 19:57:38,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:38,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 19:57:38,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:38,063 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:38,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:57:38,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [3] total 10 [2019-12-07 19:57:38,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967120396] [2019-12-07 19:57:38,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:57:38,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:38,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:57:38,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:57:38,089 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 8 states. [2019-12-07 19:57:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:38,125 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-12-07 19:57:38,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:57:38,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-07 19:57:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:38,126 INFO L225 Difference]: With dead ends: 31 [2019-12-07 19:57:38,126 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 19:57:38,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:57:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 19:57:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-12-07 19:57:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 19:57:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-12-07 19:57:38,130 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 12 [2019-12-07 19:57:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:38,130 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-12-07 19:57:38,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:57:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-12-07 19:57:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:57:38,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:38,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:38,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:38,332 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash -980107374, now seen corresponding path program 1 times [2019-12-07 19:57:38,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:38,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10763266] [2019-12-07 19:57:38,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:57:38,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10763266] [2019-12-07 19:57:38,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303538759] [2019-12-07 19:57:38,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:38,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:57:38,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:57:38,458 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:57:38,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:57:38,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [3] total 8 [2019-12-07 19:57:38,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771261462] [2019-12-07 19:57:38,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:57:38,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:57:38,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:57:38,472 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 6 states. [2019-12-07 19:57:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:38,507 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-12-07 19:57:38,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:57:38,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 19:57:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:38,508 INFO L225 Difference]: With dead ends: 52 [2019-12-07 19:57:38,508 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 19:57:38,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:57:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 19:57:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2019-12-07 19:57:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 19:57:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-12-07 19:57:38,512 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 15 [2019-12-07 19:57:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:38,512 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-12-07 19:57:38,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:57:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-12-07 19:57:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:57:38,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:38,513 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:38,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:38,714 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:38,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:38,715 INFO L82 PathProgramCache]: Analyzing trace with hash -142260125, now seen corresponding path program 1 times [2019-12-07 19:57:38,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:38,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740551475] [2019-12-07 19:57:38,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 19:57:38,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740551475] [2019-12-07 19:57:38,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034229201] [2019-12-07 19:57:38,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:38,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 19:57:38,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:38,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:57:38,878 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:38,880 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:38,881 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:57:38,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 19:57:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:57:38,887 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:38,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:57:38,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:38,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-12-07 19:57:38,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:57:38,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:38,943 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:57:38,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:38,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 8 [2019-12-07 19:57:38,945 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:38,952 INFO L614 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-12-07 19:57:38,952 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:57:38,952 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:7 [2019-12-07 19:57:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:57:38,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:57:38,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 8] total 15 [2019-12-07 19:57:38,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030010711] [2019-12-07 19:57:38,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:57:38,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:38,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:57:38,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:57:38,966 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 7 states. [2019-12-07 19:57:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:39,074 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2019-12-07 19:57:39,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:57:39,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-07 19:57:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:39,075 INFO L225 Difference]: With dead ends: 36 [2019-12-07 19:57:39,075 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 19:57:39,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:57:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 19:57:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 19:57:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 19:57:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-12-07 19:57:39,078 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 16 [2019-12-07 19:57:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:39,079 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-12-07 19:57:39,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:57:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2019-12-07 19:57:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:57:39,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:39,080 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:39,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:39,281 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash 733568695, now seen corresponding path program 1 times [2019-12-07 19:57:39,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:39,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120965668] [2019-12-07 19:57:39,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:57:39,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120965668] [2019-12-07 19:57:39,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422648300] [2019-12-07 19:57:39,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:39,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 19:57:39,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:39,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 19:57:39,442 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:39,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:39,444 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:57:39,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-12-07 19:57:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:57:39,451 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:39,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:57:39,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:57:39,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:57:39,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:57:39,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2019-12-07 19:57:39,503 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:39,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:39,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-12-07 19:57:39,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:57:39,513 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:39,516 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:57:39,517 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 19:57:39,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:57:39,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:57:39,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-12-07 19:57:39,521 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:57:39,530 INFO L614 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-12-07 19:57:39,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:57:39,530 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:85, output treesize:7 [2019-12-07 19:57:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 19:57:39,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1134370680] [2019-12-07 19:57:39,556 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 19:57:39,556 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:39,560 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:39,564 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:39,565 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:39,658 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:40,021 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:40,030 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:40,097 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:40,347 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:40,627 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-07 19:57:41,016 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:41,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:41,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 7] total 15 [2019-12-07 19:57:41,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190380407] [2019-12-07 19:57:41,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 19:57:41,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:41,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 19:57:41,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-07 19:57:41,017 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 15 states. [2019-12-07 19:57:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:41,222 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2019-12-07 19:57:41,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:57:41,222 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-07 19:57:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:41,223 INFO L225 Difference]: With dead ends: 89 [2019-12-07 19:57:41,223 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 19:57:41,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 19:57:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 19:57:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 25. [2019-12-07 19:57:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 19:57:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-12-07 19:57:41,228 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2019-12-07 19:57:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:41,228 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-12-07 19:57:41,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 19:57:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-12-07 19:57:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:57:41,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:41,229 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:41,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:41,430 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:41,431 INFO L82 PathProgramCache]: Analyzing trace with hash -972454968, now seen corresponding path program 1 times [2019-12-07 19:57:41,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:41,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859448120] [2019-12-07 19:57:41,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:57:41,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859448120] [2019-12-07 19:57:41,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671678816] [2019-12-07 19:57:41,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:41,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:57:41,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:57:41,558 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:57:41,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1183404765] [2019-12-07 19:57:41,575 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 19:57:41,575 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:41,575 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:41,575 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:41,575 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:41,712 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:41,748 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:41,962 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:41,999 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:42,341 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:42,499 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-07 19:57:42,674 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-07 19:57:43,066 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-12-07 19:57:43,420 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-07 19:57:44,178 WARN L192 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-12-07 19:57:44,487 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-12-07 19:57:44,488 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:44,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:44,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2019-12-07 19:57:44,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511512734] [2019-12-07 19:57:44,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:57:44,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:44,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:57:44,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:57:44,489 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 9 states. [2019-12-07 19:57:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:45,002 INFO L93 Difference]: Finished difference Result 90 states and 137 transitions. [2019-12-07 19:57:45,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 19:57:45,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-07 19:57:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:45,004 INFO L225 Difference]: With dead ends: 90 [2019-12-07 19:57:45,004 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 19:57:45,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2019-12-07 19:57:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 19:57:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 27. [2019-12-07 19:57:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 19:57:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-12-07 19:57:45,010 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2019-12-07 19:57:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:45,010 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-12-07 19:57:45,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:57:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-12-07 19:57:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 19:57:45,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:45,011 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:45,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:45,212 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:45,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1997619457, now seen corresponding path program 2 times [2019-12-07 19:57:45,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:45,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063035442] [2019-12-07 19:57:45,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 19:57:45,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063035442] [2019-12-07 19:57:45,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128493831] [2019-12-07 19:57:45,297 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:45,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 19:57:45,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:57:45,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 19:57:45,339 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:45,388 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 19:57:45,409 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:45,503 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 19:57:45,504 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 19:57:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 19:57:45,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2068709032] [2019-12-07 19:57:45,522 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 19:57:45,522 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:45,522 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:45,522 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:45,522 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:45,727 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:45,827 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:45,868 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:46,175 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:46,347 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-07 19:57:46,534 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-07 19:57:46,824 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-12-07 19:57:47,080 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-07 19:57:47,512 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-12-07 19:57:48,023 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-12-07 19:57:48,024 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:48,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:48,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2019-12-07 19:57:48,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861644126] [2019-12-07 19:57:48,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 19:57:48,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 19:57:48,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2019-12-07 19:57:48,027 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 19 states. [2019-12-07 19:57:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:48,847 INFO L93 Difference]: Finished difference Result 292 states and 346 transitions. [2019-12-07 19:57:48,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 19:57:48,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-12-07 19:57:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:48,850 INFO L225 Difference]: With dead ends: 292 [2019-12-07 19:57:48,850 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 19:57:48,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=581, Invalid=2841, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 19:57:48,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 19:57:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 42. [2019-12-07 19:57:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 19:57:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-12-07 19:57:48,865 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2019-12-07 19:57:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:48,865 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-12-07 19:57:48,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 19:57:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-12-07 19:57:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:57:48,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:48,866 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:49,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:49,067 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash -752769783, now seen corresponding path program 1 times [2019-12-07 19:57:49,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:49,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046839059] [2019-12-07 19:57:49,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 19:57:49,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046839059] [2019-12-07 19:57:49,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264647771] [2019-12-07 19:57:49,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:49,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 19:57:49,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 19:57:49,232 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 19:57:49,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [452721856] [2019-12-07 19:57:49,268 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 19:57:49,268 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:49,268 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:49,269 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:49,269 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:49,398 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:49,713 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:49,721 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:49,763 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:49,966 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:50,209 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-07 19:57:50,575 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:50,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:50,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 13 [2019-12-07 19:57:50,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549357729] [2019-12-07 19:57:50,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 19:57:50,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 19:57:50,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:57:50,576 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 13 states. [2019-12-07 19:57:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:52,061 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2019-12-07 19:57:52,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 19:57:52,061 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-12-07 19:57:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:52,062 INFO L225 Difference]: With dead ends: 188 [2019-12-07 19:57:52,062 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 19:57:52,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=468, Invalid=2502, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 19:57:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 19:57:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 53. [2019-12-07 19:57:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 19:57:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-12-07 19:57:52,070 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 28 [2019-12-07 19:57:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:52,070 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-12-07 19:57:52,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 19:57:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-12-07 19:57:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 19:57:52,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:52,071 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:52,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:52,273 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:52,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash 191677968, now seen corresponding path program 3 times [2019-12-07 19:57:52,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:52,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775704272] [2019-12-07 19:57:52,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 19:57:52,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775704272] [2019-12-07 19:57:52,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141515228] [2019-12-07 19:57:52,351 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:52,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 19:57:52,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:57:52,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 19:57:52,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 19:57:52,405 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 19:57:52,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069015652] [2019-12-07 19:57:52,608 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 19:57:52,608 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:52,608 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:52,608 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:52,608 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:52,724 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:52,848 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:52,979 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:53,016 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:53,216 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:53,421 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-07 19:57:53,616 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-07 19:57:53,902 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-12-07 19:57:54,195 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-07 19:57:54,639 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-12-07 19:57:54,946 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-12-07 19:57:54,947 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:54,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:54,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 13] total 20 [2019-12-07 19:57:54,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424634040] [2019-12-07 19:57:54,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 19:57:54,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 19:57:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2019-12-07 19:57:54,948 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 21 states. [2019-12-07 19:57:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:57:56,352 INFO L93 Difference]: Finished difference Result 308 states and 360 transitions. [2019-12-07 19:57:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 19:57:56,352 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-12-07 19:57:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:57:56,354 INFO L225 Difference]: With dead ends: 308 [2019-12-07 19:57:56,354 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 19:57:56,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=304, Invalid=1502, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 19:57:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 19:57:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 58. [2019-12-07 19:57:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 19:57:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-12-07 19:57:56,364 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 33 [2019-12-07 19:57:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:57:56,364 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-12-07 19:57:56,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 19:57:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2019-12-07 19:57:56,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 19:57:56,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:57:56,365 INFO L410 BasicCegarLoop]: trace histogram [10, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:57:56,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:56,566 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:57:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:57:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1600268646, now seen corresponding path program 4 times [2019-12-07 19:57:56,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:57:56,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576427617] [2019-12-07 19:57:56,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:57:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 19:57:56,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576427617] [2019-12-07 19:57:56,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310506015] [2019-12-07 19:57:56,672 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:57:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:57:56,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 19:57:56,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:57:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 19:57:56,787 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:57:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 19:57:56,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [658135245] [2019-12-07 19:57:56,914 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 19:57:56,914 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:57:56,914 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:57:56,914 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:57:56,915 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:57:57,113 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:57,219 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:57,271 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:57:57,507 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:57:57,716 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-07 19:57:57,951 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-07 19:57:58,326 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-12-07 19:57:58,612 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-07 19:57:58,968 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-12-07 19:57:59,309 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-12-07 19:57:59,310 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:57:59,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:57:59,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 24 [2019-12-07 19:57:59,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114362264] [2019-12-07 19:57:59,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 19:57:59,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:57:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 19:57:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 19:57:59,311 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 24 states. [2019-12-07 19:58:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:03,116 INFO L93 Difference]: Finished difference Result 275 states and 358 transitions. [2019-12-07 19:58:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-07 19:58:03,116 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 38 [2019-12-07 19:58:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:03,117 INFO L225 Difference]: With dead ends: 275 [2019-12-07 19:58:03,117 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 19:58:03,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3404 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1109, Invalid=10021, Unknown=0, NotChecked=0, Total=11130 [2019-12-07 19:58:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 19:58:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 66. [2019-12-07 19:58:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 19:58:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2019-12-07 19:58:03,131 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 38 [2019-12-07 19:58:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:03,131 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2019-12-07 19:58:03,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 19:58:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2019-12-07 19:58:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:58:03,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:03,132 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:58:03,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:03,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:58:03,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:03,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1961509338, now seen corresponding path program 5 times [2019-12-07 19:58:03,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:58:03,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974785313] [2019-12-07 19:58:03,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:58:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:58:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-12-07 19:58:03,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974785313] [2019-12-07 19:58:03,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124994836] [2019-12-07 19:58:03,505 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:03,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 19:58:03,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:58:03,549 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 19:58:03,551 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:58:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-12-07 19:58:03,698 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:58:03,777 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 19:58:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 19:58:03,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:58:03,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 19 [2019-12-07 19:58:03,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586767754] [2019-12-07 19:58:03,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:58:03,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:58:03,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:58:03,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:58:03,780 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 7 states. [2019-12-07 19:58:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:58:03,879 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-12-07 19:58:03,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:58:03,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 19:58:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:58:03,880 INFO L225 Difference]: With dead ends: 97 [2019-12-07 19:58:03,880 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 19:58:03,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:58:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 19:58:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2019-12-07 19:58:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 19:58:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2019-12-07 19:58:03,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 42 [2019-12-07 19:58:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:58:03,891 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2019-12-07 19:58:03,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:58:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2019-12-07 19:58:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 19:58:03,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:58:03,891 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:58:04,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:58:04,093 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:58:04,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:58:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash -121823319, now seen corresponding path program 2 times [2019-12-07 19:58:04,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:58:04,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332257700] [2019-12-07 19:58:04,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:58:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:58:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:58:04,645 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:58:04,645 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:58:04,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:58:04 BoogieIcfgContainer [2019-12-07 19:58:04,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:58:04,681 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:58:04,681 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:58:04,681 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:58:04,682 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:57:37" (3/4) ... [2019-12-07 19:58:04,683 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:58:04,724 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ac69a5ae-3c53-4929-aaa8-af2d75f360a1/bin/utaipan/witness.graphml [2019-12-07 19:58:04,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:58:04,726 INFO L168 Benchmark]: Toolchain (without parser) took 27597.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 939.8 MB in the beginning and 805.8 MB in the end (delta: 134.0 MB). Peak memory consumption was 433.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:04,726 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:58:04,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:04,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:58:04,726 INFO L168 Benchmark]: Boogie Preprocessor took 18.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:04,727 INFO L168 Benchmark]: RCFGBuilder took 285.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:04,727 INFO L168 Benchmark]: TraceAbstraction took 27030.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 209.7 MB). Free memory was 1.0 GB in the beginning and 809.1 MB in the end (delta: 237.6 MB). Peak memory consumption was 447.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:04,727 INFO L168 Benchmark]: Witness Printer took 43.58 ms. Allocated memory is still 1.3 GB. Free memory was 809.1 MB in the beginning and 805.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:58:04,728 INFO L335 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 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 285.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27030.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 209.7 MB). Free memory was 1.0 GB in the beginning and 809.1 MB in the end (delta: 237.6 MB). Peak memory consumption was 447.3 MB. Max. memory is 11.5 GB. * Witness Printer took 43.58 ms. Allocated memory is still 1.3 GB. Free memory was 809.1 MB in the beginning and 805.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] char string_entrada[10], vetor_vogais[]={'a','A','e','E','i','I','o','O','u','U','\0'}; [L16] unsigned int i,j,cont, tam_string, n_caracter; [L18] i=0 [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND FALSE !(i<10) [L21] string_entrada[10 -1]='\0' [L23] n_caracter = 0 [L24] EXPR string_entrada[n_caracter] [L24] COND TRUE string_entrada[n_caracter]!='\0' [L25] n_caracter++ [L24] EXPR string_entrada[n_caracter] [L24] COND FALSE !(string_entrada[n_caracter]!='\0') [L27] cont = 0 [L28] i=0 [L28] COND TRUE i