./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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 59941807ee61f14408f8cb6acb0590ac0607fc0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:14:13,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:14:13,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:14:13,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:14:13,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:14:13,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:14:13,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:14:13,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:14:13,209 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:14:13,209 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:14:13,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:14:13,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:14:13,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:14:13,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:14:13,211 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:14:13,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:14:13,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:14:13,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:14:13,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:14:13,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:14:13,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:14:13,215 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:14:13,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:14:13,216 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:14:13,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:14:13,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:14:13,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:14:13,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:14:13,218 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:14:13,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:14:13,219 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:14:13,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:14:13,219 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:14:13,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:14:13,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:14:13,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:14:13,220 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 09:14:13,227 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:14:13,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:14:13,228 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:14:13,228 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:14:13,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 09:14:13,228 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 09:14:13,228 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 09:14:13,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:14:13,229 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 09:14:13,230 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 09:14:13,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:14:13,230 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:14:13,230 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:14:13,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:14:13,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:14:13,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:14:13,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:14:13,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 09:14:13,230 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 09:14:13,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:14:13,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:14:13,231 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_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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 -> 59941807ee61f14408f8cb6acb0590ac0607fc0d [2018-12-02 09:14:13,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:14:13,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:14:13,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:14:13,257 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:14:13,257 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:14:13,258 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-12-02 09:14:13,291 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/data/b9850324e/8cbe626876514dd683cdea0c037acc8f/FLAG87e99572e [2018-12-02 09:14:13,722 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:14:13,723 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-12-02 09:14:13,729 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/data/b9850324e/8cbe626876514dd683cdea0c037acc8f/FLAG87e99572e [2018-12-02 09:14:13,737 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/data/b9850324e/8cbe626876514dd683cdea0c037acc8f [2018-12-02 09:14:13,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:14:13,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:14:13,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:14:13,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:14:13,742 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:14:13,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:13,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef7631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13, skipping insertion in model container [2018-12-02 09:14:13,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:13,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:14:13,766 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:14:13,904 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:14:13,940 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:14:13,966 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:14:13,995 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:14:13,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13 WrapperNode [2018-12-02 09:14:13,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:14:13,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:14:13,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:14:13,996 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:14:14,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:14,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:14,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:14:14,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:14:14,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:14:14,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:14:14,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:14,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:14,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:14,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:14,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:14,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:14,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... [2018-12-02 09:14:14,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:14:14,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:14:14,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:14:14,030 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:14:14,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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-12-02 09:14:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 09:14:14,060 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 09:14:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:14:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 09:14:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 09:14:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:14:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:14:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:14:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:14:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 09:14:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 09:14:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:14:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:14:14,201 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:14:14,201 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 09:14:14,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:14:14 BoogieIcfgContainer [2018-12-02 09:14:14,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:14:14,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:14:14,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:14:14,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:14:14,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:14:13" (1/3) ... [2018-12-02 09:14:14,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ad734b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:14:14, skipping insertion in model container [2018-12-02 09:14:14,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:13" (2/3) ... [2018-12-02 09:14:14,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ad734b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:14:14, skipping insertion in model container [2018-12-02 09:14:14,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:14:14" (3/3) ... [2018-12-02 09:14:14,206 INFO L112 eAbstractionObserver]: Analyzing ICFG list_false-unreach-call_false-valid-memcleanup.i [2018-12-02 09:14:14,211 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:14:14,216 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 09:14:14,225 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 09:14:14,241 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 09:14:14,241 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:14:14,241 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 09:14:14,241 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:14:14,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:14:14,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:14:14,241 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:14:14,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:14:14,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:14:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-12-02 09:14:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 09:14:14,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:14,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:14,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:14,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:14,259 INFO L82 PathProgramCache]: Analyzing trace with hash 517702669, now seen corresponding path program 1 times [2018-12-02 09:14:14,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:14,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:14,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:14,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:14,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:14:14,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 09:14:14,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 09:14:14,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 09:14:14,343 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-12-02 09:14:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:14,356 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-12-02 09:14:14,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 09:14:14,356 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-02 09:14:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:14,361 INFO L225 Difference]: With dead ends: 56 [2018-12-02 09:14:14,361 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 09:14:14,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 09:14:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 09:14:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 09:14:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 09:14:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-02 09:14:14,383 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-12-02 09:14:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:14,383 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-02 09:14:14,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 09:14:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-02 09:14:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 09:14:14,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:14,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:14,384 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:14,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:14,384 INFO L82 PathProgramCache]: Analyzing trace with hash -303468539, now seen corresponding path program 1 times [2018-12-02 09:14:14,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:14,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:14,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:14,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:14,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:14,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:14,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:14,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:14,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:14,452 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-12-02 09:14:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:14,535 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-02 09:14:14,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:14,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 09:14:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:14,537 INFO L225 Difference]: With dead ends: 50 [2018-12-02 09:14:14,537 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 09:14:14,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:14:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 09:14:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-12-02 09:14:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 09:14:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-02 09:14:14,544 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2018-12-02 09:14:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:14,544 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-02 09:14:14,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-12-02 09:14:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 09:14:14,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:14,545 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:14,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:14,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:14,545 INFO L82 PathProgramCache]: Analyzing trace with hash 473186688, now seen corresponding path program 1 times [2018-12-02 09:14:14,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:14,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:14,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:14,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:14,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:14,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:14,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:14,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:14,595 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 5 states. [2018-12-02 09:14:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:14,654 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-12-02 09:14:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:14,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 09:14:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:14,654 INFO L225 Difference]: With dead ends: 52 [2018-12-02 09:14:14,655 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 09:14:14,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:14:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 09:14:14,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-12-02 09:14:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 09:14:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-02 09:14:14,658 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2018-12-02 09:14:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:14,658 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-02 09:14:14,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-02 09:14:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 09:14:14,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:14,659 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:14,659 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:14,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1497889664, now seen corresponding path program 1 times [2018-12-02 09:14:14,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:14,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:14,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:14,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:14,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:14,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:14,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:14,688 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 5 states. [2018-12-02 09:14:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:14,735 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-12-02 09:14:14,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:14,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 09:14:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:14,736 INFO L225 Difference]: With dead ends: 52 [2018-12-02 09:14:14,736 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 09:14:14,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:14:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 09:14:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-12-02 09:14:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 09:14:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 09:14:14,738 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2018-12-02 09:14:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:14,739 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 09:14:14,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-02 09:14:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 09:14:14,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:14,739 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:14,739 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:14,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:14,739 INFO L82 PathProgramCache]: Analyzing trace with hash 107252780, now seen corresponding path program 1 times [2018-12-02 09:14:14,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:14,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:14,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:14,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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-12-02 09:14:14,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:14,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:14,867 INFO L478 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-12-02 09:14:14,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:14:14,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:14,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:14,882 INFO L478 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-12-02 09:14:14,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:14:14,891 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:14,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-12-02 09:14:14,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 09:14:14,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:14,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 09:14:14,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-12-02 09:14:14,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 09:14:14,935 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:14,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:14:14,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-12-02 09:14:14,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 09:14:14,960 INFO L478 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 11 treesize of output 3 [2018-12-02 09:14:14,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,966 INFO L478 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 5 treesize of output 1 [2018-12-02 09:14:14,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:14,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-12-02 09:14:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:14,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:14:14,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-12-02 09:14:14,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:14:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:14:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:14:14,993 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 10 states. [2018-12-02 09:14:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:15,139 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-12-02 09:14:15,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 09:14:15,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-02 09:14:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:15,140 INFO L225 Difference]: With dead ends: 54 [2018-12-02 09:14:15,140 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 09:14:15,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-02 09:14:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 09:14:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-12-02 09:14:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 09:14:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-02 09:14:15,143 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2018-12-02 09:14:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:15,143 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-02 09:14:15,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:14:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-02 09:14:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 09:14:15,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:15,144 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:15,144 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:15,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash 970654444, now seen corresponding path program 1 times [2018-12-02 09:14:15,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:15,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:15,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:15,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:15,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:15,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:15,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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-12-02 09:14:15,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:15,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:15,233 INFO L478 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-12-02 09:14:15,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:14:15,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:15,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:15,244 INFO L478 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-12-02 09:14:15,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:14:15,253 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:15,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,259 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-12-02 09:14:15,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 09:14:15,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:15,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 09:14:15,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-12-02 09:14:15,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 09:14:15,290 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:15,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:14:15,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-12-02 09:14:15,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 09:14:15,316 INFO L478 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 11 treesize of output 3 [2018-12-02 09:14:15,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,322 INFO L478 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 5 treesize of output 1 [2018-12-02 09:14:15,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,326 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-12-02 09:14:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:15,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:14:15,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-12-02 09:14:15,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:14:15,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:14:15,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:14:15,347 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2018-12-02 09:14:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:15,484 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-12-02 09:14:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 09:14:15,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-02 09:14:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:15,484 INFO L225 Difference]: With dead ends: 63 [2018-12-02 09:14:15,484 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 09:14:15,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-02 09:14:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 09:14:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2018-12-02 09:14:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 09:14:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-02 09:14:15,488 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2018-12-02 09:14:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:15,488 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-02 09:14:15,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:14:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-02 09:14:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 09:14:15,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:15,488 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:15,488 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:15,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1064085991, now seen corresponding path program 1 times [2018-12-02 09:14:15,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:15,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:15,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:15,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:15,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:15,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:15,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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-12-02 09:14:15,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:15,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:15,623 INFO L478 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-12-02 09:14:15,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:14:15,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:15,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:15,647 INFO L478 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-12-02 09:14:15,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-02 09:14:15,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 09:14:15,672 INFO L478 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 10 treesize of output 9 [2018-12-02 09:14:15,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 09:14:15,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 09:14:15,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2018-12-02 09:14:15,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2018-12-02 09:14:15,710 INFO L478 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 36 treesize of output 1 [2018-12-02 09:14:15,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2018-12-02 09:14:15,725 INFO L478 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 36 treesize of output 1 [2018-12-02 09:14:15,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-02 09:14:15,735 INFO L478 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 20 treesize of output 19 [2018-12-02 09:14:15,735 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,736 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,739 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-12-02 09:14:15,751 INFO L478 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-12-02 09:14:15,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-12-02 09:14:15,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 09:14:15,764 INFO L478 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 19 treesize of output 7 [2018-12-02 09:14:15,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2018-12-02 09:14:15,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:14:15,771 INFO L478 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 11 treesize of output 3 [2018-12-02 09:14:15,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:15,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 09:14:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:14:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-12-02 09:14:15,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 09:14:15,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 09:14:15,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-02 09:14:15,793 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 14 states. [2018-12-02 09:14:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:15,956 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-12-02 09:14:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:14:15,957 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-02 09:14:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:15,957 INFO L225 Difference]: With dead ends: 67 [2018-12-02 09:14:15,957 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 09:14:15,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-12-02 09:14:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 09:14:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2018-12-02 09:14:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 09:14:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-12-02 09:14:15,961 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 26 [2018-12-02 09:14:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:15,961 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-12-02 09:14:15,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 09:14:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-12-02 09:14:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 09:14:15,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:15,962 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:15,962 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:15,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:15,963 INFO L82 PathProgramCache]: Analyzing trace with hash -166249261, now seen corresponding path program 2 times [2018-12-02 09:14:15,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:15,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:15,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:16,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:16,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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-12-02 09:14:16,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 09:14:16,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 09:14:16,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:14:16,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:16,104 INFO L478 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-12-02 09:14:16,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:14:16,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:16,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:16,118 INFO L478 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-12-02 09:14:16,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:14:16,128 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:16,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,136 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-12-02 09:14:16,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 09:14:16,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:16,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 09:14:16,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-12-02 09:14:16,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 09:14:16,191 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:16,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-12-02 09:14:16,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 09:14:16,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:16,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 09:14:16,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:14:16,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-12-02 09:14:16,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:16,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-12-02 09:14:16,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:16,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 45 [2018-12-02 09:14:16,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 09:14:16,344 INFO L478 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 23 treesize of output 22 [2018-12-02 09:14:16,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:16,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 09:14:16,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:14:16,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-02 09:14:16,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-12-02 09:14:16,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 09:14:16,516 INFO L478 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 11 treesize of output 3 [2018-12-02 09:14:16,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,520 INFO L478 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 5 treesize of output 1 [2018-12-02 09:14:16,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:16,530 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-12-02 09:14:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:16,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:14:16,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-12-02 09:14:16,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 09:14:16,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 09:14:16,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-02 09:14:16,559 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 17 states. [2018-12-02 09:14:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:16,973 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-12-02 09:14:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 09:14:16,973 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-02 09:14:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:16,973 INFO L225 Difference]: With dead ends: 93 [2018-12-02 09:14:16,973 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 09:14:16,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 09:14:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 09:14:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 60. [2018-12-02 09:14:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 09:14:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-12-02 09:14:16,979 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 28 [2018-12-02 09:14:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:16,980 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-12-02 09:14:16,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 09:14:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-12-02 09:14:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 09:14:16,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:16,981 INFO L402 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] [2018-12-02 09:14:16,981 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:16,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash 433097442, now seen corresponding path program 1 times [2018-12-02 09:14:16,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:16,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:16,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:16,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:14:16,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:17,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:17,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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-12-02 09:14:17,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:17,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:17,072 INFO L478 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-12-02 09:14:17,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:14:17,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:17,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:17,097 INFO L478 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-12-02 09:14:17,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-02 09:14:17,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 09:14:17,115 INFO L478 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 10 treesize of output 9 [2018-12-02 09:14:17,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 09:14:17,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 09:14:17,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2018-12-02 09:14:17,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 121 [2018-12-02 09:14:17,157 INFO L478 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 36 treesize of output 1 [2018-12-02 09:14:17,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-02 09:14:17,171 INFO L478 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 20 treesize of output 19 [2018-12-02 09:14:17,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-12-02 09:14:17,186 INFO L478 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 36 treesize of output 1 [2018-12-02 09:14:17,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,190 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,193 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-12-02 09:14:17,207 INFO L478 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-12-02 09:14:17,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-12-02 09:14:17,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 09:14:17,217 INFO L478 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 19 treesize of output 7 [2018-12-02 09:14:17,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2018-12-02 09:14:17,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:14:17,227 INFO L478 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 11 treesize of output 3 [2018-12-02 09:14:17,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 09:14:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:17,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:14:17,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-12-02 09:14:17,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 09:14:17,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 09:14:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-02 09:14:17,262 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 14 states. [2018-12-02 09:14:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:17,423 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-12-02 09:14:17,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:14:17,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-12-02 09:14:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:17,424 INFO L225 Difference]: With dead ends: 82 [2018-12-02 09:14:17,424 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 09:14:17,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-12-02 09:14:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 09:14:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2018-12-02 09:14:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 09:14:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-12-02 09:14:17,428 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 28 [2018-12-02 09:14:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:17,429 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-12-02 09:14:17,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 09:14:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-12-02 09:14:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 09:14:17,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:17,430 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:17,430 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:17,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1457800418, now seen corresponding path program 2 times [2018-12-02 09:14:17,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:17,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:17,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:17,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:17,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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-12-02 09:14:17,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 09:14:17,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 09:14:17,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:14:17,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:17,511 INFO L478 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-12-02 09:14:17,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:14:17,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:17,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:17,533 INFO L478 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-12-02 09:14:17,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-02 09:14:17,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:14:17,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:14:17,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:14:17,559 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:17,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2018-12-02 09:14:17,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2018-12-02 09:14:17,579 INFO L478 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 36 treesize of output 1 [2018-12-02 09:14:17,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-02 09:14:17,595 INFO L478 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 20 treesize of output 19 [2018-12-02 09:14:17,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-12-02 09:14:17,608 INFO L478 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 36 treesize of output 1 [2018-12-02 09:14:17,608 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,611 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,618 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:133, output treesize:33 [2018-12-02 09:14:17,631 INFO L478 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 37 treesize of output 31 [2018-12-02 09:14:17,632 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:14:17,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-02 09:14:17,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 09:14:17,641 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:14:17,642 INFO L478 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 17 treesize of output 13 [2018-12-02 09:14:17,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2018-12-02 09:14:17,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:14:17,654 INFO L478 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 11 treesize of output 3 [2018-12-02 09:14:17,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 09:14:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:17,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:14:17,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-02 09:14:17,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:14:17,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:14:17,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:14:17,677 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 10 states. [2018-12-02 09:14:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:17,798 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-12-02 09:14:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:14:17,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-12-02 09:14:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:17,799 INFO L225 Difference]: With dead ends: 77 [2018-12-02 09:14:17,799 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 09:14:17,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-02 09:14:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 09:14:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2018-12-02 09:14:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 09:14:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-12-02 09:14:17,803 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 28 [2018-12-02 09:14:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:17,803 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-02 09:14:17,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:14:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-12-02 09:14:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 09:14:17,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:17,804 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:17,804 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:17,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash 133452691, now seen corresponding path program 1 times [2018-12-02 09:14:17,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:17,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:17,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:17,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:14:17,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:17,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:17,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/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-12-02 09:14:17,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:17,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:17,935 INFO L478 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-12-02 09:14:17,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:14:17,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:17,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:17,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-12-02 09:14:17,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,966 INFO L478 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 11 treesize of output 8 [2018-12-02 09:14:17,968 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:17,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,974 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2018-12-02 09:14:17,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 09:14:17,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:17,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 09:14:17,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:17,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2018-12-02 09:14:18,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 09:14:18,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 09:14:18,023 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:18,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,026 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,030 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2018-12-02 09:14:18,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 09:14:18,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 09:14:18,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:14:18,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2018-12-02 09:14:18,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-02 09:14:18,084 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:18,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 09:14:18,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2018-12-02 09:14:18,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-12-02 09:14:18,118 INFO L478 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 5 treesize of output 1 [2018-12-02 09:14:18,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,124 INFO L478 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 5 treesize of output 1 [2018-12-02 09:14:18,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,130 INFO L478 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 11 treesize of output 3 [2018-12-02 09:14:18,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2018-12-02 09:14:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:18,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:14:18,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-12-02 09:14:18,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 09:14:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 09:14:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-12-02 09:14:18,159 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 20 states. [2018-12-02 09:14:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:18,586 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2018-12-02 09:14:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 09:14:18,586 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-12-02 09:14:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:18,587 INFO L225 Difference]: With dead ends: 100 [2018-12-02 09:14:18,587 INFO L226 Difference]: Without dead ends: 94 [2018-12-02 09:14:18,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 09:14:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-02 09:14:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2018-12-02 09:14:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 09:14:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-12-02 09:14:18,592 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 28 [2018-12-02 09:14:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:18,593 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-02 09:14:18,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 09:14:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-12-02 09:14:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:14:18,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:18,593 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:18,594 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:18,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:18,594 INFO L82 PathProgramCache]: Analyzing trace with hash -803073330, now seen corresponding path program 1 times [2018-12-02 09:14:18,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:18,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:18,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:18,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:18,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:18,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:18,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:14:18,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:18,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:18,789 INFO L478 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-12-02 09:14:18,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:14:18,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,800 INFO L478 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-12-02 09:14:18,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:14:18,810 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:18,810 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,811 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,821 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-12-02 09:14:18,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 09:14:18,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 09:14:18,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-12-02 09:14:18,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 09:14:18,874 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:18,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-12-02 09:14:18,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 09:14:18,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 09:14:18,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:18,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:14:18,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-12-02 09:14:18,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-12-02 09:14:18,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:18,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 45 [2018-12-02 09:14:18,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 09:14:19,022 INFO L478 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 23 treesize of output 22 [2018-12-02 09:14:19,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:19,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 09:14:19,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:14:19,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-02 09:14:19,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-12-02 09:14:19,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-12-02 09:14:19,123 INFO L478 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 11 treesize of output 3 [2018-12-02 09:14:19,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,127 INFO L478 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 5 treesize of output 1 [2018-12-02 09:14:19,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:19,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:19,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-12-02 09:14:19,142 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 09:14:19,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 09:14:19,147 INFO L478 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 5 treesize of output 1 [2018-12-02 09:14:19,148 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:14:19,154 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:53, output treesize:7 [2018-12-02 09:14:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:19,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:14:19,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 16 [2018-12-02 09:14:19,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 09:14:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 09:14:19,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-12-02 09:14:19,180 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 16 states. [2018-12-02 09:14:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:19,535 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-12-02 09:14:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 09:14:19,535 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-02 09:14:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:19,536 INFO L225 Difference]: With dead ends: 90 [2018-12-02 09:14:19,536 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 09:14:19,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-12-02 09:14:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 09:14:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2018-12-02 09:14:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 09:14:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-12-02 09:14:19,540 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 30 [2018-12-02 09:14:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:19,540 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-12-02 09:14:19,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 09:14:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-12-02 09:14:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:14:19,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:19,540 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:19,540 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:19,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash 221629646, now seen corresponding path program 3 times [2018-12-02 09:14:19,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:19,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:19,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:19,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:19,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:14:19,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:14:19,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:14:19,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:14:19,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:19,707 INFO L478 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-12-02 09:14:19,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:14:19,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:19,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:19,716 INFO L478 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-12-02 09:14:19,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-02 09:14:19,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:14:19,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:14:19,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:14:19,752 INFO L478 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 8 treesize of output 7 [2018-12-02 09:14:19,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-12-02 09:14:19,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:19,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-02 09:14:19,788 INFO L478 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 12 treesize of output 15 [2018-12-02 09:14:19,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:19,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-12-02 09:14:19,808 INFO L478 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 16 treesize of output 19 [2018-12-02 09:14:19,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,822 INFO L478 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 11 treesize of output 12 [2018-12-02 09:14:19,823 INFO L478 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 12 treesize of output 15 [2018-12-02 09:14:19,823 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,825 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,831 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:77, output treesize:51 [2018-12-02 09:14:19,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 130 [2018-12-02 09:14:19,855 INFO L478 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 18 treesize of output 17 [2018-12-02 09:14:19,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118 [2018-12-02 09:14:19,880 INFO L478 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 18 treesize of output 17 [2018-12-02 09:14:19,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-12-02 09:14:19,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:19,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-12-02 09:14:19,903 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,905 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:19,912 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:140, output treesize:68 [2018-12-02 09:14:19,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 150 [2018-12-02 09:14:19,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:19,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 152 [2018-12-02 09:14:19,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,206 INFO L478 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 148 treesize of output 108 [2018-12-02 09:14:20,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 111 [2018-12-02 09:14:20,291 INFO L478 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 110 treesize of output 70 [2018-12-02 09:14:20,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:20,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 82 [2018-12-02 09:14:20,418 INFO L478 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 73 treesize of output 57 [2018-12-02 09:14:20,419 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:20,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2018-12-02 09:14:20,470 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,487 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:14:20,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 09:14:20,510 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:162, output treesize:134 [2018-12-02 09:14:20,610 INFO L478 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 79 treesize of output 69 [2018-12-02 09:14:20,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-12-02 09:14:20,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:20,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-02 09:14:20,638 INFO L478 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 23 treesize of output 7 [2018-12-02 09:14:20,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,644 INFO L478 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 11 treesize of output 3 [2018-12-02 09:14:20,644 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,668 INFO L478 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 90 treesize of output 80 [2018-12-02 09:14:20,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2018-12-02 09:14:20,670 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,680 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53 [2018-12-02 09:14:20,703 INFO L478 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 23 treesize of output 7 [2018-12-02 09:14:20,704 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,710 INFO L478 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 20 treesize of output 11 [2018-12-02 09:14:20,710 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,715 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 09:14:20,733 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:170, output treesize:48 [2018-12-02 09:14:20,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:20,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:14:20,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-12-02 09:14:20,824 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 09:14:20,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 09:14:20,830 INFO L478 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 5 treesize of output 1 [2018-12-02 09:14:20,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:14:20,840 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-12-02 09:14:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:20,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:14:20,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-12-02 09:14:20,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 09:14:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 09:14:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-12-02 09:14:20,870 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 22 states. [2018-12-02 09:14:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:21,602 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2018-12-02 09:14:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 09:14:21,602 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-12-02 09:14:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:21,603 INFO L225 Difference]: With dead ends: 105 [2018-12-02 09:14:21,603 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 09:14:21,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 09:14:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 09:14:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2018-12-02 09:14:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 09:14:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2018-12-02 09:14:21,608 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 30 [2018-12-02 09:14:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:21,608 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2018-12-02 09:14:21,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 09:14:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2018-12-02 09:14:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:14:21,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:21,609 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:21,609 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:21,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:21,609 INFO L82 PathProgramCache]: Analyzing trace with hash -552306290, now seen corresponding path program 1 times [2018-12-02 09:14:21,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:14:21,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:14:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:21,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:14:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:14:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:14:21,631 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 09:14:21,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:14:21 BoogieIcfgContainer [2018-12-02 09:14:21,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:14:21,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:14:21,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:14:21,652 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:14:21,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:14:14" (3/4) ... [2018-12-02 09:14:21,653 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 09:14:21,680 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c0cb3099-08c4-4ca1-a530-8534ae0dd122/bin-2019/uautomizer/witness.graphml [2018-12-02 09:14:21,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:14:21,681 INFO L168 Benchmark]: Toolchain (without parser) took 7942.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 951.7 MB in the beginning and 878.0 MB in the end (delta: 73.7 MB). Peak memory consumption was 243.0 MB. Max. memory is 11.5 GB. [2018-12-02 09:14:21,682 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:14:21,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -123.3 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-12-02 09:14:21,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:14:21,682 INFO L168 Benchmark]: Boogie Preprocessor took 17.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:14:21,682 INFO L168 Benchmark]: RCFGBuilder took 171.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:14:21,682 INFO L168 Benchmark]: TraceAbstraction took 7449.12 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 878.0 MB in the end (delta: 171.9 MB). Peak memory consumption was 255.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:14:21,683 INFO L168 Benchmark]: Witness Printer took 29.16 ms. Allocated memory is still 1.2 GB. Free memory is still 878.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:14:21,683 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -123.3 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 171.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7449.12 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 878.0 MB in the end (delta: 171.9 MB). Peak memory consumption was 255.7 MB. Max. memory is 11.5 GB. * Witness Printer took 29.16 ms. Allocated memory is still 1.2 GB. Free memory is still 878.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={18:0}, malloc(sizeof(struct node))={18:0}] [L628] COND FALSE !(a == 0) VAL [a={18:0}, malloc(sizeof(struct node))={18:0}] [L629] List t; [L630] List p = a; VAL [a={18:0}, malloc(sizeof(struct node))={18:0}, p={18:0}] [L631] COND TRUE __VERIFIER_nondet_int() [L632] p->h = 1 [L633] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={18:0}, t={21:0}] [L634] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={18:0}, t={21:0}] [L635] p->n = t [L636] EXPR p->n [L636] p = p->n [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND TRUE __VERIFIER_nondet_int() [L639] p->h = 2 [L640] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={21:0}, t={11:0}] [L641] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={21:0}, t={11:0}] [L642] p->n = t [L643] EXPR p->n [L643] p = p->n [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 [L646] p = a VAL [a={18:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={18:0}, t={11:0}] [L647] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={18:0}, p->h=1, t={11:0}] [L647] COND FALSE !(p->h == 2) [L649] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={18:0}, p->h=1, t={11:0}] [L649] COND TRUE p->h == 1 [L650] EXPR p->n [L650] p = p->n [L649] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={21:0}, p->h=2, t={11:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={18:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={21:0}, p->h=2, t={11:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={18:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={21:0}, malloc(sizeof(struct node))={18:0}, p={21:0}, t={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. UNSAFE Result, 7.4s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 296 SDtfs, 775 SDslu, 1653 SDs, 0 SdLazy, 2073 SolverSat, 332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 191 SyntacticMatches, 30 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=13, 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, 13 MinimizatonAttempts, 205 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 602 NumberOfCodeBlocks, 602 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 550 ConstructedInterpolants, 31 QuantifiedInterpolants, 170065 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1029 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 20/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...