./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d15e59fd1b84d7219285b33cc166f567d0bcf3e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-09 09:31:43,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:31:43,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:31:43,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:31:43,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:31:43,604 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:31:43,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:31:43,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:31:43,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:31:43,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:31:43,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:31:43,608 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:31:43,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:31:43,609 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:31:43,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:31:43,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:31:43,610 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:31:43,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:31:43,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:31:43,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:31:43,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:31:43,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:31:43,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:31:43,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:31:43,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:31:43,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:31:43,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:31:43,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:31:43,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:31:43,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:31:43,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:31:43,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:31:43,618 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:31:43,618 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:31:43,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:31:43,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:31:43,619 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 09:31:43,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:31:43,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:31:43,627 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:31:43,627 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:31:43,627 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:31:43,627 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:31:43,628 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:31:43,628 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:31:43,628 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:31:43,628 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:31:43,628 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:31:43,628 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:31:43,628 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:31:43,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:31:43,629 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:31:43,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:31:43,630 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:31:43,630 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 09:31:43,631 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d15e59fd1b84d7219285b33cc166f567d0bcf3e [2018-12-09 09:31:43,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:31:43,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:31:43,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:31:43,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:31:43,662 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:31:43,662 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-12-09 09:31:43,704 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/data/57f9f793d/73bd31e6638947d0af388855cb5df6bc/FLAG674985d79 [2018-12-09 09:31:44,023 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:31:44,023 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-12-09 09:31:44,027 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/data/57f9f793d/73bd31e6638947d0af388855cb5df6bc/FLAG674985d79 [2018-12-09 09:31:44,035 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/data/57f9f793d/73bd31e6638947d0af388855cb5df6bc [2018-12-09 09:31:44,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:31:44,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:31:44,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:31:44,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:31:44,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:31:44,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccca87c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44, skipping insertion in model container [2018-12-09 09:31:44,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:31:44,056 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:31:44,149 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:31:44,154 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:31:44,166 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:31:44,175 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:31:44,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44 WrapperNode [2018-12-09 09:31:44,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:31:44,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:31:44,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:31:44,176 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:31:44,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:31:44,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:31:44,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:31:44,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:31:44,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... [2018-12-09 09:31:44,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:31:44,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:31:44,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:31:44,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:31:44,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:31:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 09:31:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:31:44,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:31:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-09 09:31:44,268 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-09 09:31:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 09:31:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:31:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:31:44,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:31:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:31:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:31:44,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:31:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 09:31:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:31:44,435 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:31:44,436 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 09:31:44,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:31:44 BoogieIcfgContainer [2018-12-09 09:31:44,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:31:44,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:31:44,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:31:44,439 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:31:44,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:31:44" (1/3) ... [2018-12-09 09:31:44,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469d6c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:31:44, skipping insertion in model container [2018-12-09 09:31:44,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:44" (2/3) ... [2018-12-09 09:31:44,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469d6c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:31:44, skipping insertion in model container [2018-12-09 09:31:44,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:31:44" (3/3) ... [2018-12-09 09:31:44,442 INFO L112 eAbstractionObserver]: Analyzing ICFG test27_false-unreach-call_true-termination.c [2018-12-09 09:31:44,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:31:44,456 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 09:31:44,468 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 09:31:44,486 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:31:44,486 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:31:44,486 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:31:44,486 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:31:44,486 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:31:44,486 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:31:44,486 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:31:44,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:31:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-09 09:31:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 09:31:44,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:44,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:44,501 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:44,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-12-09 09:31:44,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:44,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:44,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:44,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:44,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:31:44,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:44,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 09:31:44,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 09:31:44,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 09:31:44,599 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-12-09 09:31:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:44,610 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-12-09 09:31:44,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 09:31:44,610 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-12-09 09:31:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:44,616 INFO L225 Difference]: With dead ends: 42 [2018-12-09 09:31:44,616 INFO L226 Difference]: Without dead ends: 20 [2018-12-09 09:31:44,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 09:31:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-09 09:31:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 09:31:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 09:31:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-09 09:31:44,638 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-12-09 09:31:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:44,638 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-09 09:31:44,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 09:31:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-09 09:31:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 09:31:44,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:44,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:44,639 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:44,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:44,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-12-09 09:31:44,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:44,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:44,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:44,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:44,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:31:44,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:44,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:31:44,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:31:44,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:31:44,678 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-12-09 09:31:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:44,699 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-09 09:31:44,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:31:44,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 09:31:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:44,700 INFO L225 Difference]: With dead ends: 34 [2018-12-09 09:31:44,700 INFO L226 Difference]: Without dead ends: 22 [2018-12-09 09:31:44,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:31:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-09 09:31:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-09 09:31:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 09:31:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-09 09:31:44,703 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-09 09:31:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:44,703 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-09 09:31:44,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:31:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-09 09:31:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:31:44,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:44,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:44,704 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:44,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:44,704 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-12-09 09:31:44,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:44,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:44,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:44,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:31:44,745 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-09 09:31:44,747 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [21], [24], [29], [32], [39], [42], [52], [55], [56], [57], [58], [59], [61], [62] [2018-12-09 09:31:44,766 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:31:44,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:31:44,911 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:31:44,912 INFO L272 AbstractInterpreter]: Visited 20 different actions 43 times. Merged at 11 different actions 17 times. Widened at 1 different actions 1 times. Performed 420 root evaluator evaluations with a maximum evaluation depth of 5. Performed 420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 45 variables. [2018-12-09 09:31:44,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:44,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:31:44,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:44,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:44,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:44,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:31:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:44,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:44,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:31:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:31:45,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-09 09:31:45,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:31:45,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:31:45,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:31:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:45,002 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-12-09 09:31:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:45,020 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-09 09:31:45,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:31:45,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 09:31:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:45,021 INFO L225 Difference]: With dead ends: 36 [2018-12-09 09:31:45,021 INFO L226 Difference]: Without dead ends: 24 [2018-12-09 09:31:45,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-09 09:31:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-09 09:31:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 09:31:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-09 09:31:45,024 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-09 09:31:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:45,024 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-09 09:31:45,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:31:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-09 09:31:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 09:31:45,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:45,025 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:45,025 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:45,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-12-09 09:31:45,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:45,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:31:45,076 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:31:45,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:31:45,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:45,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:45,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:31:45,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:31:45,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 09:31:45,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:31:45,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:31:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:31:45,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-09 09:31:45,176 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:31:45,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:31:45,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:31:45,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:31:45,176 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-12-09 09:31:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:45,196 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-12-09 09:31:45,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:31:45,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 09:31:45,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:45,197 INFO L225 Difference]: With dead ends: 38 [2018-12-09 09:31:45,197 INFO L226 Difference]: Without dead ends: 26 [2018-12-09 09:31:45,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:31:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-09 09:31:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-09 09:31:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 09:31:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-09 09:31:45,200 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-09 09:31:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:45,200 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-09 09:31:45,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:31:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-09 09:31:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 09:31:45,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:45,201 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:45,201 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:45,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2113766385, now seen corresponding path program 3 times [2018-12-09 09:31:45,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:31:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:45,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:31:45,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:31:45,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:31:45,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:45,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:45,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:31:45,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:31:45,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:31:45,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:31:45,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:31:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:31:45,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-09 09:31:45,333 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:31:45,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:31:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:31:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:31:45,334 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-12-09 09:31:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:45,364 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-12-09 09:31:45,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:31:45,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-09 09:31:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:45,365 INFO L225 Difference]: With dead ends: 40 [2018-12-09 09:31:45,365 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 09:31:45,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:31:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 09:31:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-09 09:31:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 09:31:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-09 09:31:45,368 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-09 09:31:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:45,368 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-09 09:31:45,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:31:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-09 09:31:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:31:45,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:45,369 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:45,369 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:45,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1818492333, now seen corresponding path program 4 times [2018-12-09 09:31:45,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:45,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:31:45,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:45,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:31:45,426 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:31:45,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:31:45,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:45,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:45,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:45,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:31:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:45,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:31:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:31:45,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-09 09:31:45,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:31:45,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:31:45,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:31:45,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:45,548 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-12-09 09:31:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:45,579 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-09 09:31:45,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:31:45,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-09 09:31:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:45,581 INFO L225 Difference]: With dead ends: 42 [2018-12-09 09:31:45,581 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 09:31:45,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 09:31:45,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-09 09:31:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 09:31:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-09 09:31:45,584 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-09 09:31:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:45,585 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-09 09:31:45,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:31:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-09 09:31:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 09:31:45,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:45,585 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:45,586 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:45,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1147899851, now seen corresponding path program 5 times [2018-12-09 09:31:45,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:45,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:45,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:31:45,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:31:45,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:31:45,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:45,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:45,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:31:45,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:31:45,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 09:31:45,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:31:45,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:45,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:31:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:46,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:31:46,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-12-09 09:31:46,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:31:46,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:31:46,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:31:46,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:46,001 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2018-12-09 09:31:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:46,027 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-09 09:31:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:31:46,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-09 09:31:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:46,028 INFO L225 Difference]: With dead ends: 44 [2018-12-09 09:31:46,028 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 09:31:46,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 09:31:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-09 09:31:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 09:31:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-09 09:31:46,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-09 09:31:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:46,030 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-09 09:31:46,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:31:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-09 09:31:46,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 09:31:46,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:46,031 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:46,031 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:46,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash -953619049, now seen corresponding path program 6 times [2018-12-09 09:31:46,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:31:46,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:46,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:46,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:31:46,077 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:31:46,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:31:46,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:46,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:46,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:31:46,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:31:46,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:31:46,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:31:46,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:46,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:31:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:46,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:31:46,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-12-09 09:31:46,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:31:46,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:31:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:31:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:46,182 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-12-09 09:31:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:46,212 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-12-09 09:31:46,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:31:46,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-12-09 09:31:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:46,213 INFO L225 Difference]: With dead ends: 46 [2018-12-09 09:31:46,213 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 09:31:46,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 09:31:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-09 09:31:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 09:31:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-09 09:31:46,216 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-09 09:31:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:46,216 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-09 09:31:46,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:31:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-09 09:31:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 09:31:46,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:46,217 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:46,217 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:46,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:46,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1066637945, now seen corresponding path program 7 times [2018-12-09 09:31:46,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:46,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:31:46,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:46,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:46,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:31:46,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:31:46,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:31:46,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:46,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:46,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:46,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:31:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:46,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:46,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:31:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:46,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:31:46,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-12-09 09:31:46,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:31:46,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:31:46,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:31:46,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:46,410 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-12-09 09:31:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:46,440 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-12-09 09:31:46,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:31:46,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-09 09:31:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:46,441 INFO L225 Difference]: With dead ends: 48 [2018-12-09 09:31:46,441 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 09:31:46,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 09:31:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-09 09:31:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 09:31:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-09 09:31:46,445 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-09 09:31:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:46,445 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-09 09:31:46,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:31:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-09 09:31:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 09:31:46,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:46,446 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:46,446 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:46,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1208391387, now seen corresponding path program 8 times [2018-12-09 09:31:46,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:46,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:46,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:46,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:46,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:31:46,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:31:46,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:31:46,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:46,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:46,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:31:46,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:31:49,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-09 09:31:49,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:31:49,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:49,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:31:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:49,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:31:49,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-12-09 09:31:49,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:31:49,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:31:49,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:31:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:49,643 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2018-12-09 09:31:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:49,671 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-09 09:31:49,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:31:49,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-12-09 09:31:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:49,672 INFO L225 Difference]: With dead ends: 50 [2018-12-09 09:31:49,672 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 09:31:49,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 09:31:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-09 09:31:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 09:31:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-09 09:31:49,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-09 09:31:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:49,675 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-09 09:31:49,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:31:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-09 09:31:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:31:49,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:49,675 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:49,675 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:49,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash -5504323, now seen corresponding path program 9 times [2018-12-09 09:31:49,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:49,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:49,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:31:49,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:49,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:49,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:49,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:31:49,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:31:49,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:31:49,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:31:49,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:31:49,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:31:49,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:31:49,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:31:49,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:31:49,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:31:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:49,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:31:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:31:49,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:31:49,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-12-09 09:31:49,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:31:49,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:31:49,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:31:49,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:49,867 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-12-09 09:31:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:49,896 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-12-09 09:31:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:31:49,896 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-12-09 09:31:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:49,897 INFO L225 Difference]: With dead ends: 51 [2018-12-09 09:31:49,897 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 09:31:49,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 09:31:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 09:31:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 09:31:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-09 09:31:49,899 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-09 09:31:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:49,899 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-09 09:31:49,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:31:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-09 09:31:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 09:31:49,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:49,900 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:49,900 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:31:49,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:49,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1671822879, now seen corresponding path program 10 times [2018-12-09 09:31:49,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:49,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:31:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:49,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:31:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:31:50,116 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:31:50,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:31:50 BoogieIcfgContainer [2018-12-09 09:31:50,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:31:50,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:31:50,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:31:50,140 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:31:50,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:31:44" (3/4) ... [2018-12-09 09:31:50,142 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 09:31:50,176 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_13ed7a33-4ac2-4a18-bcbf-b93ae51028f0/bin-2019/utaipan/witness.graphml [2018-12-09 09:31:50,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:31:50,177 INFO L168 Benchmark]: Toolchain (without parser) took 6139.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 956.7 MB in the beginning and 887.5 MB in the end (delta: 69.2 MB). Peak memory consumption was 265.8 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:50,178 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:31:50,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.35 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:50,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:50,178 INFO L168 Benchmark]: Boogie Preprocessor took 18.52 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:50,178 INFO L168 Benchmark]: RCFGBuilder took 199.54 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:50,178 INFO L168 Benchmark]: TraceAbstraction took 5703.25 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 895.6 MB in the end (delta: 181.3 MB). Peak memory consumption was 271.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:50,179 INFO L168 Benchmark]: Witness Printer took 36.18 ms. Allocated memory is still 1.2 GB. Free memory was 895.6 MB in the beginning and 887.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:50,180 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.35 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.52 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.54 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5703.25 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 895.6 MB in the end (delta: 181.3 MB). Peak memory consumption was 271.5 MB. Max. memory is 11.5 GB. * Witness Printer took 36.18 ms. Allocated memory is still 1.2 GB. Free memory was 895.6 MB in the beginning and 887.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 51]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] struct cont cont; [L23] struct dummy dummy; [L24] struct dummy *dummies[10]; [L25] int a[10]; [L26] int i, *pa; [L27] i = __VERIFIER_nondet_int() [L28] int j = 0; VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=0] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=1] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=2] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=3] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=4] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=5] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=6] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=7] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=8] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=9] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L28] COND FALSE !(j < 10) VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L32] COND TRUE i >= 0 && i < 9 [L33] a[i] = i [L34] dummy.array = &a[i] [L35] dummies[i + 1] = &dummy [L36] cont.array = &dummies[0] [L37] EXPR cont.array [L37] EXPR cont.array[i] [L37] EXPR cont.array[i]->array [L37] pa = &cont.array[i]->array[i] [L38] EXPR a[i] VAL [a={102:0}, a[i]=1, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10, pa={57:0}] [L38] COND TRUE a[i] > 0 [L39] EXPR dummies[i + 1] [L39] EXPR dummies[i + 1]->array [L39] EXPR dummies[i + 1]->array[i] [L39] i = dummies[i + 1]->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L40] COND FALSE !(i < *pa) [L43] CALL, EXPR check(&cont, i) VAL [\old(i)=0, pc={72:0}] [L17] EXPR pc->array [L17] EXPR pc->array[i] [L17] EXPR pc->array[i]->array [L17] EXPR pc->array[i]->array[i] [L17] return pc->array[i]->array[i] == i; [L43] RET, EXPR check(&cont, i) VAL [a={102:0}, check(&cont, i)=0, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L43] COND TRUE !check(&cont, i) [L51] __VERIFIER_error() VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 5.6s OverallTime, 12 OverallIterations, 10 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 218 SDtfs, 55 SDslu, 833 SDs, 0 SdLazy, 190 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 572 GetRequests, 454 SyntacticMatches, 30 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 762 ConstructedInterpolants, 0 QuantifiedInterpolants, 38460 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1395 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 0/855 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...