./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_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer --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 Automizer --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-11-10 04:54:57,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:54:57,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:54:57,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:54:57,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:54:57,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:54:57,097 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:54:57,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:54:57,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:54:57,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:54:57,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:54:57,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:54:57,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:54:57,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:54:57,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:54:57,103 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:54:57,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:54:57,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:54:57,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:54:57,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:54:57,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:54:57,108 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:54:57,109 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:54:57,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:54:57,110 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:54:57,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:54:57,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:54:57,111 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:54:57,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:54:57,113 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:54:57,113 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:54:57,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:54:57,114 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:54:57,114 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:54:57,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:54:57,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:54:57,115 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 04:54:57,122 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:54:57,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:54:57,123 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:54:57,124 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:54:57,124 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:54:57,124 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:54:57,124 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:54:57,124 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:54:57,125 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:54:57,125 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:54:57,125 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:54:57,125 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:54:57,125 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:54:57,125 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:54:57,125 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:54:57,126 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:54:57,126 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:54:57,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:54:57,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:54:57,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:54:57,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:54:57,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:54:57,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:54:57,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:54:57,127 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:54:57,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:54:57,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:54:57,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:54:57,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:54:57,127 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer 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 -> Automizer 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-11-10 04:54:57,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:54:57,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:54:57,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:54:57,162 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:54:57,162 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:54:57,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-11-10 04:54:57,201 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/data/1d79bd331/9b09f4ea9331403d90041e056bf0c196/FLAG46e836e81 [2018-11-10 04:54:57,605 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:54:57,605 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-11-10 04:54:57,609 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/data/1d79bd331/9b09f4ea9331403d90041e056bf0c196/FLAG46e836e81 [2018-11-10 04:54:57,618 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/data/1d79bd331/9b09f4ea9331403d90041e056bf0c196 [2018-11-10 04:54:57,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:54:57,621 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 04:54:57,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:54:57,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:54:57,625 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:54:57,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:57" (1/1) ... [2018-11-10 04:54:57,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b97816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57, skipping insertion in model container [2018-11-10 04:54:57,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:57" (1/1) ... [2018-11-10 04:54:57,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:54:57,648 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:54:57,756 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:54:57,766 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:54:57,778 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:54:57,790 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:54:57,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57 WrapperNode [2018-11-10 04:54:57,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:54:57,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:54:57,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:54:57,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:54:57,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57" (1/1) ... [2018-11-10 04:54:57,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57" (1/1) ... [2018-11-10 04:54:57,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57" (1/1) ... [2018-11-10 04:54:57,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57" (1/1) ... [2018-11-10 04:54:57,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57" (1/1) ... [2018-11-10 04:54:57,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57" (1/1) ... [2018-11-10 04:54:57,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57" (1/1) ... [2018-11-10 04:54:57,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:54:57,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:54:57,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:54:57,822 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:54:57,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:54:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:54:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:54:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-10 04:54:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-10 04:54:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-10 04:54:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:54:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 04:54:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 04:54:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-10 04:54:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-10 04:54:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:54:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-10 04:54:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-10 04:54:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:54:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:54:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:54:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 04:54:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 04:54:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:54:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 04:54:58,202 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:54:58,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:54:58 BoogieIcfgContainer [2018-11-10 04:54:58,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:54:58,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:54:58,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:54:58,206 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:54:58,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:54:57" (1/3) ... [2018-11-10 04:54:58,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12eb2c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:58, skipping insertion in model container [2018-11-10 04:54:58,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:57" (2/3) ... [2018-11-10 04:54:58,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12eb2c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:58, skipping insertion in model container [2018-11-10 04:54:58,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:54:58" (3/3) ... [2018-11-10 04:54:58,210 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_false-unreach-call.c [2018-11-10 04:54:58,218 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:54:58,226 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:54:58,239 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:54:58,267 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:54:58,268 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:54:58,268 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:54:58,268 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:54:58,268 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:54:58,268 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:54:58,268 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:54:58,268 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:54:58,268 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:54:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-11-10 04:54:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 04:54:58,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:54:58,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:54:58,294 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:54:58,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash 211714867, now seen corresponding path program 1 times [2018-11-10 04:54:58,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:58,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:58,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:54:58,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:54:58,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:54:58,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 04:54:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:54:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:54:58,511 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 2 states. [2018-11-10 04:54:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:54:58,526 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-10 04:54:58,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:54:58,527 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 82 [2018-11-10 04:54:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:54:58,534 INFO L225 Difference]: With dead ends: 101 [2018-11-10 04:54:58,535 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 04:54:58,537 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-11-10 04:54:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 04:54:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-10 04:54:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 04:54:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-11-10 04:54:58,567 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 82 [2018-11-10 04:54:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:54:58,569 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-11-10 04:54:58,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 04:54:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-10 04:54:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:54:58,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:54:58,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:54:58,572 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:54:58,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1243526489, now seen corresponding path program 1 times [2018-11-10 04:54:58,573 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:58,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:58,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:58,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:58,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:59,231 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 10 [2018-11-10 04:54:59,412 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 23 [2018-11-10 04:54:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:54:59,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:54:59,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 04:54:59,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 04:54:59,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 04:54:59,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:54:59,704 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 15 states. [2018-11-10 04:55:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:55:00,188 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-10 04:55:00,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 04:55:00,190 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-11-10 04:55:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:55:00,193 INFO L225 Difference]: With dead ends: 115 [2018-11-10 04:55:00,193 INFO L226 Difference]: Without dead ends: 105 [2018-11-10 04:55:00,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-11-10 04:55:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-10 04:55:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2018-11-10 04:55:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 04:55:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-11-10 04:55:00,204 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 84 [2018-11-10 04:55:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:55:00,207 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-11-10 04:55:00,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 04:55:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-11-10 04:55:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:55:00,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:55:00,209 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:55:00,209 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:55:00,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:55:00,210 INFO L82 PathProgramCache]: Analyzing trace with hash 734053399, now seen corresponding path program 1 times [2018-11-10 04:55:00,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:55:00,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:55:00,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:00,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:55:00,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 04:55:00,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:55:00,343 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:55:00,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:55:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:00,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:55:00,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 04:55:00,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:00,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:00,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 04:55:00,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:55:00,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:55:00,448 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 04:55:00,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:00,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:00,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-10 04:55:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:00,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:55:00,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-11-10 04:55:00,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 04:55:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 04:55:00,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:55:00,503 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 14 states. [2018-11-10 04:55:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:55:00,848 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-11-10 04:55:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 04:55:00,851 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 84 [2018-11-10 04:55:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:55:00,852 INFO L225 Difference]: With dead ends: 122 [2018-11-10 04:55:00,852 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 04:55:00,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-11-10 04:55:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 04:55:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2018-11-10 04:55:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 04:55:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-10 04:55:00,861 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 84 [2018-11-10 04:55:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:55:00,861 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-10 04:55:00,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 04:55:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-10 04:55:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:55:00,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:55:00,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:55:00,863 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:55:00,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:55:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash 952908117, now seen corresponding path program 1 times [2018-11-10 04:55:00,863 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:55:00,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:55:00,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:00,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:55:00,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:01,367 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 9 [2018-11-10 04:55:01,533 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 10 [2018-11-10 04:55:01,695 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 10 [2018-11-10 04:55:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:55:02,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:55:02,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-10 04:55:02,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 04:55:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 04:55:02,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-11-10 04:55:02,077 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 17 states. [2018-11-10 04:55:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:55:02,499 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-10 04:55:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 04:55:02,499 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-11-10 04:55:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:55:02,500 INFO L225 Difference]: With dead ends: 116 [2018-11-10 04:55:02,500 INFO L226 Difference]: Without dead ends: 106 [2018-11-10 04:55:02,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2018-11-10 04:55:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-10 04:55:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2018-11-10 04:55:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 04:55:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-10 04:55:02,509 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 84 [2018-11-10 04:55:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:55:02,509 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-10 04:55:02,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 04:55:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-10 04:55:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:55:02,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:55:02,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:55:02,510 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:55:02,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:55:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1140082873, now seen corresponding path program 1 times [2018-11-10 04:55:02,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:55:02,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:55:02,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:02,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:55:02,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:55:03,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:55:03,149 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:55:03,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:55:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:03,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:55:03,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 04:55:03,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 04:55:03,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:03,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:03,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:03,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 04:55:03,379 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 36 treesize of output 30 [2018-11-10 04:55:03,381 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-10 04:55:03,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:03,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:03,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:03,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-10 04:55:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:55:03,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:55:03,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 25 [2018-11-10 04:55:03,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 04:55:03,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 04:55:03,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-11-10 04:55:03,435 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 25 states. [2018-11-10 04:55:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:55:04,190 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-10 04:55:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 04:55:04,190 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2018-11-10 04:55:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:55:04,191 INFO L225 Difference]: With dead ends: 124 [2018-11-10 04:55:04,191 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 04:55:04,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 04:55:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 04:55:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-11-10 04:55:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 04:55:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-10 04:55:04,200 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 87 [2018-11-10 04:55:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:55:04,201 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-10 04:55:04,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 04:55:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-10 04:55:04,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:55:04,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:55:04,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:55:04,203 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:55:04,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:55:04,203 INFO L82 PathProgramCache]: Analyzing trace with hash -297934389, now seen corresponding path program 1 times [2018-11-10 04:55:04,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:55:04,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:55:04,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:04,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:55:04,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:04,617 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 10 [2018-11-10 04:55:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:55:05,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:55:05,192 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:55:05,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:55:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:05,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:55:05,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 04:55:05,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 04:55:05,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:05,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:05,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:05,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 04:55:05,476 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 36 treesize of output 30 [2018-11-10 04:55:05,478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-10 04:55:05,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:05,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:05,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:05,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-10 04:55:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:55:05,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:55:05,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 29 [2018-11-10 04:55:05,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-10 04:55:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 04:55:05,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2018-11-10 04:55:05,521 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 29 states. [2018-11-10 04:55:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:55:06,439 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-10 04:55:06,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 04:55:06,439 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 87 [2018-11-10 04:55:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:55:06,440 INFO L225 Difference]: With dead ends: 128 [2018-11-10 04:55:06,440 INFO L226 Difference]: Without dead ends: 118 [2018-11-10 04:55:06,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=267, Invalid=1713, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 04:55:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-10 04:55:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2018-11-10 04:55:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 04:55:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-10 04:55:06,448 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 87 [2018-11-10 04:55:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:55:06,448 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-10 04:55:06,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-10 04:55:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-10 04:55:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 04:55:06,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:55:06,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:55:06,449 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:55:06,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:55:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 139632135, now seen corresponding path program 2 times [2018-11-10 04:55:06,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:55:06,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:55:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:55:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:06,897 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 20 [2018-11-10 04:55:07,172 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 40 [2018-11-10 04:55:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:55:07,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:55:07,728 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:55:07,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:55:08,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:55:08,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:55:08,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:55:09,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 04:55:09,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 04:55:09,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:09,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:09,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:09,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 04:55:09,261 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 36 treesize of output 30 [2018-11-10 04:55:09,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-10 04:55:09,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:09,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:09,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:09,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-10 04:55:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 04:55:09,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:55:09,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2018-11-10 04:55:09,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 04:55:09,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 04:55:09,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 04:55:09,318 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2018-11-10 04:55:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:55:10,488 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-11-10 04:55:10,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 04:55:10,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 93 [2018-11-10 04:55:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:55:10,489 INFO L225 Difference]: With dead ends: 142 [2018-11-10 04:55:10,489 INFO L226 Difference]: Without dead ends: 132 [2018-11-10 04:55:10,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=447, Invalid=2523, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 04:55:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-10 04:55:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2018-11-10 04:55:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 04:55:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-10 04:55:10,497 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 93 [2018-11-10 04:55:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:55:10,498 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-10 04:55:10,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 04:55:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-10 04:55:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 04:55:10,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:55:10,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:55:10,499 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:55:10,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:55:10,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1500763531, now seen corresponding path program 2 times [2018-11-10 04:55:10,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:55:10,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:55:10,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:10,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:55:10,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:10,821 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 35 [2018-11-10 04:55:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:55:11,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:55:11,560 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:55:11,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:55:12,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:55:12,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:55:12,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:55:12,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 04:55:12,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 04:55:12,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:12,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:12,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:12,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 04:55:12,995 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 39 treesize of output 33 [2018-11-10 04:55:12,997 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-11-10 04:55:12,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:13,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:13,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:13,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:9 [2018-11-10 04:55:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 04:55:13,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:55:13,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 36 [2018-11-10 04:55:13,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 04:55:13,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 04:55:13,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 04:55:13,050 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 36 states. [2018-11-10 04:55:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:55:15,057 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-10 04:55:15,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-10 04:55:15,058 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 93 [2018-11-10 04:55:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:55:15,058 INFO L225 Difference]: With dead ends: 187 [2018-11-10 04:55:15,058 INFO L226 Difference]: Without dead ends: 177 [2018-11-10 04:55:15,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1089, Invalid=5553, Unknown=0, NotChecked=0, Total=6642 [2018-11-10 04:55:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-10 04:55:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 107. [2018-11-10 04:55:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 04:55:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-10 04:55:15,067 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 93 [2018-11-10 04:55:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:55:15,067 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-10 04:55:15,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 04:55:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-10 04:55:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 04:55:15,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:55:15,068 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:55:15,068 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:55:15,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:55:15,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1151059065, now seen corresponding path program 3 times [2018-11-10 04:55:15,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:55:15,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:55:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:15,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:55:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:55:16,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:55:16,661 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:55:16,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:55:18,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 04:55:18,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:55:18,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:55:18,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 04:55:18,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 04:55:18,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:18,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:18,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:18,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 04:55:19,081 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 36 treesize of output 30 [2018-11-10 04:55:19,082 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-10 04:55:19,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:19,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:19,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:19,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-10 04:55:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 04:55:19,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:55:19,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 45 [2018-11-10 04:55:19,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-10 04:55:19,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-10 04:55:19,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1834, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 04:55:19,137 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 45 states. [2018-11-10 04:55:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:55:21,459 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-11-10 04:55:21,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 04:55:21,459 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 105 [2018-11-10 04:55:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:55:21,460 INFO L225 Difference]: With dead ends: 166 [2018-11-10 04:55:21,460 INFO L226 Difference]: Without dead ends: 156 [2018-11-10 04:55:21,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=816, Invalid=4734, Unknown=0, NotChecked=0, Total=5550 [2018-11-10 04:55:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-10 04:55:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2018-11-10 04:55:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 04:55:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-10 04:55:21,472 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 105 [2018-11-10 04:55:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:55:21,472 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-10 04:55:21,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-10 04:55:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-10 04:55:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 04:55:21,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:55:21,473 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:55:21,473 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:55:21,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:55:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2063971061, now seen corresponding path program 3 times [2018-11-10 04:55:21,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:55:21,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:55:21,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:21,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:55:21,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:22,525 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 357 DAG size of output: 49 [2018-11-10 04:55:22,733 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 37 [2018-11-10 04:55:22,937 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 388 DAG size of output: 32 [2018-11-10 04:55:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:55:23,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:55:23,998 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:55:24,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:55:26,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 04:55:26,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:55:26,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:55:26,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 04:55:26,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-10 04:55:26,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:26,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:26,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:26,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-10 04:55:27,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 34 treesize of output 28 [2018-11-10 04:55:27,337 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:55:27,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-10 04:55:27,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:55:27,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:27,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:55:27,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:5 [2018-11-10 04:55:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 04:55:27,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:55:27,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 24] total 55 [2018-11-10 04:55:27,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 04:55:27,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 04:55:27,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2795, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 04:55:27,410 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 55 states. [2018-11-10 04:55:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:55:32,274 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2018-11-10 04:55:32,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-10 04:55:32,274 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2018-11-10 04:55:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:55:32,275 INFO L225 Difference]: With dead ends: 168 [2018-11-10 04:55:32,275 INFO L226 Difference]: Without dead ends: 158 [2018-11-10 04:55:32,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2567 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1326, Invalid=10884, Unknown=0, NotChecked=0, Total=12210 [2018-11-10 04:55:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-10 04:55:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 119. [2018-11-10 04:55:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 04:55:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-10 04:55:32,288 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 105 [2018-11-10 04:55:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:55:32,288 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-10 04:55:32,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 04:55:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-10 04:55:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 04:55:32,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:55:32,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:55:32,289 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:55:32,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:55:32,289 INFO L82 PathProgramCache]: Analyzing trace with hash -109733625, now seen corresponding path program 4 times [2018-11-10 04:55:32,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:55:32,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:55:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:32,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:55:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:55:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:55:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:55:32,348 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 04:55:32,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:55:32 BoogieIcfgContainer [2018-11-10 04:55:32,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:55:32,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:55:32,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:55:32,394 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:55:32,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:54:58" (3/4) ... [2018-11-10 04:55:32,396 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:55:32,447 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_96fe76e0-8b28-4b1c-aaee-a80cc3f072d0/bin-2019/uautomizer/witness.graphml [2018-11-10 04:55:32,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:55:32,448 INFO L168 Benchmark]: Toolchain (without parser) took 34827.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 597.2 MB). Free memory was 960.3 MB in the beginning and 1.4 GB in the end (delta: -459.8 MB). Peak memory consumption was 137.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:55:32,449 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:55:32,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.62 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:55:32,449 INFO L168 Benchmark]: Boogie Preprocessor took 30.86 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:55:32,449 INFO L168 Benchmark]: RCFGBuilder took 380.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:55:32,449 INFO L168 Benchmark]: TraceAbstraction took 34189.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 471.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -330.3 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:55:32,450 INFO L168 Benchmark]: Witness Printer took 53.90 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-10 04:55:32,454 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.62 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.86 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 380.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34189.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 471.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -330.3 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. * Witness Printer took 53.90 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 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.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] FCALL struct dummy d1, d2; VAL [\old(d1)=80, \old(d1)=74, \old(d2)=75, \old(d2)=79, d1={77:0}, d2={76:0}] [L33] CALL init() VAL [d1={77:0}, d2={76:0}] [L14] FCALL d1.a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, d1={77:0}, d2={76:0}] [L15] FCALL d1.b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, d1={77:0}, d2={76:0}] [L17] FCALL d2.a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, d1={77:0}, d2={76:0}] [L18] RET, FCALL d2.b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, d1={77:0}, d2={76:0}] [L33] init() VAL [d1={77:0}, d2={76:0}] [L34] CALL, EXPR get_dummy() VAL [d1={77:0}, d2={76:0}] [L23] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={77:0}, d1={77:0}, d2={76:0}] [L23] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] EXPR get_dummy() VAL [d1={77:0}, d2={76:0}, get_dummy()={77:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L34] CALL, EXPR get_dummy() VAL [d1={77:0}, d2={76:0}] [L23] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={77:0}, d1={77:0}, d2={76:0}] [L23] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] EXPR get_dummy() VAL [d1={77:0}, d2={76:0}, get_dummy()={77:0}, pd1={77: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 VAL [d1={77:0}, d2={76:0}, i=0, pd1={77:0}, pd2={77:0}] [L37] FCALL pd2->array[i] = i VAL [d1={77:0}, d2={76:0}, i=0, pd1={77:0}, pd2={77:0}] [L38] int *pa = &pd1->array[i]; VAL [d1={77:0}, d2={76:0}, i=0, pa={77:8}, pd1={77:0}, pd2={77:0}] [L39] EXPR, FCALL pd2->array[i] VAL [d1={77:0}, d2={76:0}, i=0, pa={77:8}, pd1={77:0}, pd2={77:0}, pd2->array[i]=0] [L39] i = pd2->array[i] - 10 [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-10, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=-9, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-9, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=-8, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-8, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=-7, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-7, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=-6, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-6, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=-5, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-5, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=-4, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-4, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=-3, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-3, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=-2, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-2, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=-1, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=-1, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=0, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=0, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={77:0}, d2={76:0}, i=1, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] EXPR, FCALL \read(*pa) VAL [\read(*pa)=0, d1={77:0}, d2={76:0}, i=1, pa={77:8}, pd1={77:0}, pd2={77:0}] [L40] COND FALSE !(i <= *pa) [L43] CALL, EXPR check(pd2, i) VAL [\old(i)=1, d1={77:0}, d2={76:0}, s1={77:0}] [L28] EXPR, FCALL s1->array[i] VAL [\old(i)=1, d1={77:0}, d2={76:0}, i=1, s1={77:0}, s1={77:0}, s1->array[i]=0] [L28] RET return s1->array[i] == i; [L43] EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={77:0}, d2={76:0}, i=1, pa={77:8}, pd1={77:0}, pd2={77:0}] [L43] COND TRUE !check(pd2, i) [L50] __VERIFIER_error() VAL [d1={77:0}, d2={76:0}, i=1, pa={77:8}, pd1={77:0}, pd2={77:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 86 locations, 1 error locations. UNSAFE Result, 34.1s OverallTime, 11 OverallIterations, 12 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 526 SDtfs, 1343 SDslu, 6065 SDs, 0 SdLazy, 11352 SolverSat, 530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 594 SyntacticMatches, 35 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6251 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 230 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 1675 NumberOfCodeBlocks, 1675 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1541 ConstructedInterpolants, 84 QuantifiedInterpolants, 1225820 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1560 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 55/488 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...