./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/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 b974f281a213c0803f91ef44d205e442fb2a5f8f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-1dbac8b [2018-10-26 20:27:23,171 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:27:23,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:27:23,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:27:23,189 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:27:23,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:27:23,191 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:27:23,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:27:23,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:27:23,193 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:27:23,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:27:23,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:27:23,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:27:23,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:27:23,196 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:27:23,197 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:27:23,197 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:27:23,199 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:27:23,200 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:27:23,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:27:23,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:27:23,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:27:23,204 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:27:23,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:27:23,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:27:23,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:27:23,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:27:23,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:27:23,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:27:23,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:27:23,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:27:23,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:27:23,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:27:23,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:27:23,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:27:23,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:27:23,211 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:27:23,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:27:23,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:27:23,222 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:27:23,222 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:27:23,222 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:27:23,222 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:27:23,222 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:27:23,222 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:27:23,223 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:27:23,223 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:27:23,223 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:27:23,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:27:23,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:27:23,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:27:23,224 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:27:23,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:27:23,224 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:27:23,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:27:23,224 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:27:23,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:27:23,225 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:27:23,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:27:23,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:27:23,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:27:23,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:27:23,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:27:23,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:27:23,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:27:23,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:27:23,226 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:27:23,226 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:27:23,226 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:27:23,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:27:23,226 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:27:23,226 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_40c56d82-a515-416d-80a7-c48a9bb15a2b/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 -> b974f281a213c0803f91ef44d205e442fb2a5f8f [2018-10-26 20:27:23,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:27:23,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:27:23,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:27:23,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:27:23,265 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:27:23,265 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-10-26 20:27:23,312 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/data/f2f7fc335/540f2daede204355b3b0c3e229cb357b/FLAGe1c526e51 [2018-10-26 20:27:23,686 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:27:23,687 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-10-26 20:27:23,692 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/data/f2f7fc335/540f2daede204355b3b0c3e229cb357b/FLAGe1c526e51 [2018-10-26 20:27:23,702 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/data/f2f7fc335/540f2daede204355b3b0c3e229cb357b [2018-10-26 20:27:23,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:27:23,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:27:23,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:27:23,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:27:23,710 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:27:23,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a0eb45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23, skipping insertion in model container [2018-10-26 20:27:23,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:27:23,745 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:27:23,865 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:27:23,875 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:27:23,891 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:27:23,905 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:27:23,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23 WrapperNode [2018-10-26 20:27:23,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:27:23,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:27:23,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:27:23,907 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:27:23,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:27:23,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:27:23,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:27:23,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:27:23,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... [2018-10-26 20:27:23,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:27:23,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:27:23,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:27:23,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:27:23,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/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-10-26 20:27:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-10-26 20:27:24,150 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-10-26 20:27:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:27:24,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:27:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-10-26 20:27:24,150 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-10-26 20:27:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:27:24,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:27:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:27:24,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:27:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-10-26 20:27:24,151 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-10-26 20:27:24,778 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:27:24,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:27:24 BoogieIcfgContainer [2018-10-26 20:27:24,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:27:24,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:27:24,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:27:24,782 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:27:24,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:27:23" (1/3) ... [2018-10-26 20:27:24,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25853a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:27:24, skipping insertion in model container [2018-10-26 20:27:24,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:27:23" (2/3) ... [2018-10-26 20:27:24,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25853a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:27:24, skipping insertion in model container [2018-10-26 20:27:24,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:27:24" (3/3) ... [2018-10-26 20:27:24,785 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_false-unreach-call.c [2018-10-26 20:27:24,793 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:27:24,799 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:27:24,811 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:27:24,833 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:27:24,834 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:27:24,834 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:27:24,834 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:27:24,834 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:27:24,834 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:27:24,834 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:27:24,834 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:27:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-10-26 20:27:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:27:24,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:27:24,854 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:27:24,856 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:27:24,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:27:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1854594140, now seen corresponding path program 1 times [2018-10-26 20:27:24,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:27:24,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:24,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:27:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:24,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:27:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:27:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:25,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:27:25,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:27:25,027 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:27:25,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 20:27:25,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 20:27:25,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 20:27:25,044 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-10-26 20:27:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:27:25,061 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-10-26 20:27:25,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 20:27:25,063 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-10-26 20:27:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:27:25,070 INFO L225 Difference]: With dead ends: 47 [2018-10-26 20:27:25,070 INFO L226 Difference]: Without dead ends: 29 [2018-10-26 20:27:25,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 20:27:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-26 20:27:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-26 20:27:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-26 20:27:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-26 20:27:25,106 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 30 [2018-10-26 20:27:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:27:25,108 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-26 20:27:25,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 20:27:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-26 20:27:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 20:27:25,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:27:25,109 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:27:25,110 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:27:25,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:27:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1069042410, now seen corresponding path program 1 times [2018-10-26 20:27:25,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:27:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:25,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:27:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:25,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:27:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:27:25,734 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-26 20:27:26,735 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 18 [2018-10-26 20:27:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:26,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:27:26,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 20:27:26,769 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:27:26,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:27:26,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:27:26,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:27:26,771 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 10 states. [2018-10-26 20:27:27,398 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-26 20:27:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:27:27,550 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-10-26 20:27:27,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 20:27:27,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-10-26 20:27:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:27:27,555 INFO L225 Difference]: With dead ends: 60 [2018-10-26 20:27:27,555 INFO L226 Difference]: Without dead ends: 52 [2018-10-26 20:27:27,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-26 20:27:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-26 20:27:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2018-10-26 20:27:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-26 20:27:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-26 20:27:27,568 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 32 [2018-10-26 20:27:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:27:27,568 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-26 20:27:27,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 20:27:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-26 20:27:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 20:27:27,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:27:27,569 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:27:27,570 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:27:27,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:27:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash 214882965, now seen corresponding path program 1 times [2018-10-26 20:27:27,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:27:27,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:27,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:27:27,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:27,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:27:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:27:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:27,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:27:27,782 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:27:27,782 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-10-26 20:27:27,784 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [9], [13], [14], [17], [19], [22], [26], [28], [31], [33], [38], [41], [48], [51], [52], [53], [54], [55], [57], [58], [59], [60], [61], [62], [63], [64] [2018-10-26 20:27:27,827 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:27:27,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:27:28,011 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:27:28,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:27:28,331 INFO L272 AbstractInterpreter]: Visited 30 different actions 35 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 43 variables. [2018-10-26 20:27:28,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:27:28,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:27:28,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:27:28,374 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/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-10-26 20:27:28,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:27:28,388 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:27:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:27:28,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:27:29,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-26 20:27:29,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-26 20:27:29,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:27:29,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:27:29,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:27:29,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-10-26 20:27:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:29,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:27:29,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2018-10-26 20:27:29,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-10-26 20:27:29,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:27:29,281 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:27:29,282 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:27:29,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-10-26 20:27:29,285 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:27:29,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:27:29,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 20:27:29,313 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:17 [2018-10-26 20:27:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:29,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:27:29,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 23 [2018-10-26 20:27:29,490 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:27:29,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 20:27:29,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 20:27:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-10-26 20:27:29,492 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 21 states. [2018-10-26 20:27:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:27:30,038 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-10-26 20:27:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 20:27:30,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-10-26 20:27:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:27:30,039 INFO L225 Difference]: With dead ends: 66 [2018-10-26 20:27:30,039 INFO L226 Difference]: Without dead ends: 58 [2018-10-26 20:27:30,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2018-10-26 20:27:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-26 20:27:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2018-10-26 20:27:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-26 20:27:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-10-26 20:27:30,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 35 [2018-10-26 20:27:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:27:30,048 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-10-26 20:27:30,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 20:27:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-10-26 20:27:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 20:27:30,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:27:30,049 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:27:30,050 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:27:30,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:27:30,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1632085770, now seen corresponding path program 2 times [2018-10-26 20:27:30,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:27:30,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:30,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:27:30,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:30,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:27:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:27:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:30,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:27:30,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:27:30,253 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:27:30,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:27:30,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:27:30,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/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-10-26 20:27:30,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 20:27:30,260 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 20:27:30,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 20:27:30,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:27:30,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:27:30,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-26 20:27:30,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-26 20:27:30,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:27:30,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:27:30,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:27:30,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-10-26 20:27:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 20:27:30,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:27:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:30,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:27:30,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 6] total 24 [2018-10-26 20:27:30,999 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:27:30,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-26 20:27:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-26 20:27:31,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:27:31,000 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 22 states. [2018-10-26 20:27:31,765 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-10-26 20:27:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:27:32,343 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-10-26 20:27:32,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-26 20:27:32,343 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-10-26 20:27:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:27:32,344 INFO L225 Difference]: With dead ends: 97 [2018-10-26 20:27:32,344 INFO L226 Difference]: Without dead ends: 89 [2018-10-26 20:27:32,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=563, Invalid=2517, Unknown=0, NotChecked=0, Total=3080 [2018-10-26 20:27:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-26 20:27:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2018-10-26 20:27:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 20:27:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-10-26 20:27:32,354 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 38 [2018-10-26 20:27:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:27:32,354 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-10-26 20:27:32,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-26 20:27:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-10-26 20:27:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 20:27:32,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:27:32,356 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:27:32,356 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:27:32,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:27:32,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1460488967, now seen corresponding path program 1 times [2018-10-26 20:27:32,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:27:32,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:32,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:27:32,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:32,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:27:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:27:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:32,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:27:32,566 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:27:32,566 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-10-26 20:27:32,566 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [11], [13], [14], [17], [19], [22], [26], [28], [31], [33], [38], [41], [48], [51], [52], [53], [54], [55], [57], [58], [59], [60], [61], [62], [63], [64] [2018-10-26 20:27:32,569 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:27:32,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:27:32,598 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:27:32,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:27:32,733 INFO L272 AbstractInterpreter]: Visited 30 different actions 35 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 43 variables. [2018-10-26 20:27:32,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:27:32,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:27:32,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:27:32,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/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-10-26 20:27:32,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:27:32,786 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:27:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:27:32,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:27:33,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:27:33,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-26 20:27:33,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:27:33,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:27:33,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:27:33,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-26 20:27:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 20:27:33,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:27:33,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2018-10-26 20:27:33,220 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:27:33,221 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:27:33,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-10-26 20:27:33,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:27:33,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-10-26 20:27:33,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:27:33,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:27:33,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 20:27:33,238 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-26 20:27:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 20:27:33,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:27:33,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 36 [2018-10-26 20:27:33,502 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:27:33,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-26 20:27:33,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-26 20:27:33,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1126, Unknown=0, NotChecked=0, Total=1260 [2018-10-26 20:27:33,503 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 26 states. [2018-10-26 20:27:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:27:34,547 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-10-26 20:27:34,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-26 20:27:34,550 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2018-10-26 20:27:34,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:27:34,551 INFO L225 Difference]: With dead ends: 102 [2018-10-26 20:27:34,551 INFO L226 Difference]: Without dead ends: 94 [2018-10-26 20:27:34,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=631, Invalid=3151, Unknown=0, NotChecked=0, Total=3782 [2018-10-26 20:27:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-26 20:27:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 47. [2018-10-26 20:27:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 20:27:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-10-26 20:27:34,562 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 41 [2018-10-26 20:27:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:27:34,563 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-10-26 20:27:34,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-26 20:27:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-10-26 20:27:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 20:27:34,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:27:34,565 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:27:34,566 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:27:34,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:27:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1601148746, now seen corresponding path program 3 times [2018-10-26 20:27:34,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:27:34,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:34,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:27:34,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:34,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:27:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:27:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:35,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:27:35,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:27:35,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:27:35,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:27:35,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:27:35,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/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-10-26 20:27:35,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 20:27:35,170 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 20:27:35,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 20:27:35,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:27:35,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:27:35,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:27:35,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-26 20:27:35,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:27:35,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:27:35,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:27:35,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-26 20:27:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:35,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:27:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:27:35,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:27:35,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 23 [2018-10-26 20:27:35,477 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:27:35,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 20:27:35,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 20:27:35,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-10-26 20:27:35,478 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 23 states. [2018-10-26 20:27:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:27:36,486 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-10-26 20:27:36,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-26 20:27:36,487 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-10-26 20:27:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:27:36,488 INFO L225 Difference]: With dead ends: 120 [2018-10-26 20:27:36,488 INFO L226 Difference]: Without dead ends: 112 [2018-10-26 20:27:36,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 89 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1168, Invalid=3524, Unknown=0, NotChecked=0, Total=4692 [2018-10-26 20:27:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-26 20:27:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 62. [2018-10-26 20:27:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-26 20:27:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-10-26 20:27:36,502 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 50 [2018-10-26 20:27:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:27:36,502 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-10-26 20:27:36,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 20:27:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-10-26 20:27:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:27:36,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:27:36,504 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:27:36,506 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:27:36,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:27:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash 333527541, now seen corresponding path program 4 times [2018-10-26 20:27:36,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:27:36,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:36,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:27:36,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:27:36,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:27:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:27:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:27:36,579 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:27:36,593 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:27:36,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:27:36,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:27:36,595 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:27:36,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:27:36 BoogieIcfgContainer [2018-10-26 20:27:36,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:27:36,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:27:36,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:27:36,627 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:27:36,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:27:24" (3/4) ... [2018-10-26 20:27:36,631 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:27:36,633 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:27:36,634 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:27:36,634 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:27:36,634 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:27:36,690 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_40c56d82-a515-416d-80a7-c48a9bb15a2b/bin-2019/utaipan/witness.graphml [2018-10-26 20:27:36,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:27:36,694 INFO L168 Benchmark]: Toolchain (without parser) took 12987.85 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 365.4 MB). Free memory was 961.1 MB in the beginning and 1.3 GB in the end (delta: -305.7 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:27:36,694 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:27:36,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.93 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:27:36,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.90 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:27:36,695 INFO L168 Benchmark]: Boogie Preprocessor took 39.43 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:27:36,695 INFO L168 Benchmark]: RCFGBuilder took 790.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:27:36,695 INFO L168 Benchmark]: TraceAbstraction took 11847.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 161.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -122.4 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-10-26 20:27:36,696 INFO L168 Benchmark]: Witness Printer took 65.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-10-26 20:27:36,697 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.93 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 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.90 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.43 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 790.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11847.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 161.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -122.4 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Witness Printer took 65.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] CALL struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L10] RET struct dummy d1, d2; [L33] CALL init() VAL [d1={76:0}, d2={74:0}] [L14] CALL d1.a = __VERIFIER_nondet_int() [L14] RET d1.a = __VERIFIER_nondet_int() [L15] CALL d1.b = __VERIFIER_nondet_int() [L15] RET d1.b = __VERIFIER_nondet_int() [L17] CALL d2.a = __VERIFIER_nondet_int() [L17] RET d2.a = __VERIFIER_nondet_int() [L18] CALL d2.b = __VERIFIER_nondet_int() [L18] RET d2.b = __VERIFIER_nondet_int() [L33] init() VAL [d1={76:0}, d2={74:0}] [L34] CALL, EXPR get_dummy() VAL [d1={76:0}, d2={74:0}] [L23] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={76:0}, d1={76:0}, d2={74:0}] [L23] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] EXPR get_dummy() VAL [d1={76:0}, d2={74:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L34] CALL, EXPR get_dummy() VAL [d1={76:0}, d2={74:0}] [L23] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={76:0}, d1={76:0}, d2={74:0}] [L23] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] EXPR get_dummy() VAL [d1={76:0}, d2={74:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L35] int i = __VERIFIER_nondet_int(); [L36] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L37] CALL pd2->array[i] = i [L37] RET pd2->array[i] = i [L38] int *pa = &pd1->array[i]; [L39] CALL, EXPR pd2->array[i] [L39] RET, EXPR pd2->array[i] [L39] i = pd2->array[i] - 10 [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={76:0}, d2={74:0}] [L40] CALL, EXPR \read(*pa) [L40] RET, EXPR \read(*pa) [L40] COND FALSE !(i <= *pa) [L43] CALL, EXPR check(pd2, i) VAL [d1={76:0}, d2={74:0}] [L28] CALL, EXPR s1->array[i] [L28] RET, EXPR s1->array[i] [L28] RET return s1->array[i] == i; [L43] EXPR check(pd2, i) VAL [d1={76:0}, d2={74:0}] [L43] COND TRUE !check(pd2, i) [L50] __VERIFIER_error() VAL [d1={76:0}, d2={74:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. UNSAFE Result, 11.8s OverallTime, 7 OverallIterations, 12 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 457 SDslu, 1674 SDs, 0 SdLazy, 1108 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 524 GetRequests, 269 SyntacticMatches, 28 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3192 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 181 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 455 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 540 ConstructedInterpolants, 16 QuantifiedInterpolants, 102767 SizeOfPredicates, 80 NumberOfNonLiveVariables, 962 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 50/335 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...