./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 13:02:46,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:02:46,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:02:46,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:02:46,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:02:46,498 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:02:46,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:02:46,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:02:46,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:02:46,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:02:46,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:02:46,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:02:46,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:02:46,504 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:02:46,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:02:46,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:02:46,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:02:46,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:02:46,508 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:02:46,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:02:46,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:02:46,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:02:46,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:02:46,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:02:46,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:02:46,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:02:46,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:02:46,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:02:46,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:02:46,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:02:46,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:02:46,516 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:02:46,516 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:02:46,516 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:02:46,517 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:02:46,518 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:02:46,518 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:02:46,527 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:02:46,527 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:02:46,528 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:02:46,528 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:02:46,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:02:46,529 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:02:46,529 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:02:46,529 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:02:46,529 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:02:46,529 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:02:46,530 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:02:46,530 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:02:46,530 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:02:46,530 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:02:46,530 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:02:46,530 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:02:46,530 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:02:46,531 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:02:46,531 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:02:46,531 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:02:46,531 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:02:46,531 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:02:46,531 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:02:46,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:02:46,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:02:46,532 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:02:46,532 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:02:46,532 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:02:46,532 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:02:46,532 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:02:46,532 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_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-28 13:02:46,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:02:46,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:02:46,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:02:46,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:02:46,568 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:02:46,568 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-28 13:02:46,607 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/data/95b77451f/2c185e8056934590bc39c504e89a3dc8/FLAG1009bdd73 [2018-11-28 13:02:47,027 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:02:47,028 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-28 13:02:47,034 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/data/95b77451f/2c185e8056934590bc39c504e89a3dc8/FLAG1009bdd73 [2018-11-28 13:02:47,043 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/data/95b77451f/2c185e8056934590bc39c504e89a3dc8 [2018-11-28 13:02:47,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:02:47,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:02:47,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:02:47,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:02:47,050 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:02:47,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29741fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47, skipping insertion in model container [2018-11-28 13:02:47,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:02:47,085 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:02:47,274 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:02:47,282 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:02:47,356 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:02:47,382 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:02:47,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47 WrapperNode [2018-11-28 13:02:47,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:02:47,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:02:47,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:02:47,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:02:47,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:02:47,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:02:47,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:02:47,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:02:47,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... [2018-11-28 13:02:47,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:02:47,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:02:47,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:02:47,435 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:02:47,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:02:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:02:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:02:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:02:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:02:47,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:02:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:02:47,471 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:02:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:02:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:02:47,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:02:47,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:02:47,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:02:47,842 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:02:47,842 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-28 13:02:47,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:02:47 BoogieIcfgContainer [2018-11-28 13:02:47,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:02:47,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:02:47,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:02:47,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:02:47,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:02:47" (1/3) ... [2018-11-28 13:02:47,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1d65ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:02:47, skipping insertion in model container [2018-11-28 13:02:47,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:02:47" (2/3) ... [2018-11-28 13:02:47,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1d65ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:02:47, skipping insertion in model container [2018-11-28 13:02:47,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:02:47" (3/3) ... [2018-11-28 13:02:47,850 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-28 13:02:47,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:02:47,861 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-28 13:02:47,870 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-28 13:02:47,889 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:02:47,889 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:02:47,889 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:02:47,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:02:47,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:02:47,890 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:02:47,890 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:02:47,890 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:02:47,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:02:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-11-28 13:02:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:02:47,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:47,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:47,908 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:47,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:47,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1252939669, now seen corresponding path program 1 times [2018-11-28 13:02:47,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:47,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:47,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:47,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:47,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:02:48,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 13:02:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 13:02:48,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 13:02:48,028 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2018-11-28 13:02:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,043 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-11-28 13:02:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:02:48,044 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 13:02:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,051 INFO L225 Difference]: With dead ends: 98 [2018-11-28 13:02:48,051 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 13:02:48,053 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-11-28 13:02:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 13:02:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 13:02:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 13:02:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-28 13:02:48,076 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2018-11-28 13:02:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,076 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-28 13:02:48,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 13:02:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-28 13:02:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:02:48,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,077 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:48,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash -249318588, now seen corresponding path program 1 times [2018-11-28 13:02:48,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:48,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:48,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:48,143 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2018-11-28 13:02:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,214 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-28 13:02:48,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:02:48,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 13:02:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,215 INFO L225 Difference]: With dead ends: 51 [2018-11-28 13:02:48,215 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 13:02:48,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 13:02:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-28 13:02:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 13:02:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-28 13:02:48,219 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 11 [2018-11-28 13:02:48,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,219 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-28 13:02:48,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-28 13:02:48,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 13:02:48,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,220 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:48,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash 861058516, now seen corresponding path program 1 times [2018-11-28 13:02:48,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:48,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:48,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:48,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:48,267 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-11-28 13:02:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,337 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-28 13:02:48,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:02:48,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 13:02:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,338 INFO L225 Difference]: With dead ends: 43 [2018-11-28 13:02:48,338 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 13:02:48,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 13:02:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 13:02:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 13:02:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-28 13:02:48,341 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 12 [2018-11-28 13:02:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,341 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-28 13:02:48,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-28 13:02:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:02:48,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,342 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:48,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1447599299, now seen corresponding path program 1 times [2018-11-28 13:02:48,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:48,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:02:48,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:02:48,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:48,428 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2018-11-28 13:02:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,536 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-28 13:02:48,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:48,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 13:02:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,538 INFO L225 Difference]: With dead ends: 66 [2018-11-28 13:02:48,538 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 13:02:48,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-11-28 13:02:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 13:02:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-11-28 13:02:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 13:02:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-28 13:02:48,544 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 14 [2018-11-28 13:02:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,544 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-28 13:02:48,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-28 13:02:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:02:48,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,545 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:48,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2041464428, now seen corresponding path program 1 times [2018-11-28 13:02:48,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:48,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:48,610 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 4 states. [2018-11-28 13:02:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,682 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-28 13:02:48,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:02:48,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-28 13:02:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,683 INFO L225 Difference]: With dead ends: 48 [2018-11-28 13:02:48,683 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 13:02:48,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 13:02:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-28 13:02:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 13:02:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-28 13:02:48,688 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-11-28 13:02:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,688 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-28 13:02:48,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-28 13:02:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 13:02:48,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,689 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:48,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash 952866840, now seen corresponding path program 1 times [2018-11-28 13:02:48,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:48,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:48,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:48,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:48,745 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-11-28 13:02:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,782 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-28 13:02:48,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:02:48,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-28 13:02:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,783 INFO L225 Difference]: With dead ends: 46 [2018-11-28 13:02:48,783 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 13:02:48,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:48,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 13:02:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 13:02:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 13:02:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-28 13:02:48,788 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2018-11-28 13:02:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,788 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-28 13:02:48,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-28 13:02:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:02:48,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:48,789 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:48,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1947786916, now seen corresponding path program 1 times [2018-11-28 13:02:48,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:48,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:48,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:48,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:02:48,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:02:48,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:48,873 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-11-28 13:02:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:48,939 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-28 13:02:48,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:02:48,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-28 13:02:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:48,940 INFO L225 Difference]: With dead ends: 59 [2018-11-28 13:02:48,940 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 13:02:48,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 13:02:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-28 13:02:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 13:02:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-28 13:02:48,944 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-11-28 13:02:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:48,944 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-28 13:02:48,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-28 13:02:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 13:02:48,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:48,945 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] [2018-11-28 13:02:48,946 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:48,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1663987840, now seen corresponding path program 1 times [2018-11-28 13:02:48,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:48,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:49,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:49,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:49,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:49,101 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 27 treesize of output 24 [2018-11-28 13:02:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-28 13:02:49,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,111 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-28 13:02:49,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-28 13:02:49,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,152 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 27 treesize of output 24 [2018-11-28 13:02:49,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-28 13:02:49,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,158 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-28 13:02:49,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-28 13:02:49,180 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,197 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,202 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,206 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,212 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-11-28 13:02:49,238 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 24 treesize of output 18 [2018-11-28 13:02:49,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,241 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 18 treesize of output 10 [2018-11-28 13:02:49,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,251 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 24 treesize of output 18 [2018-11-28 13:02:49,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,253 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 18 treesize of output 10 [2018-11-28 13:02:49,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-11-28 13:02:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:49,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:49,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-28 13:02:49,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:02:49,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:02:49,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:02:49,286 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-11-28 13:02:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:49,476 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-28 13:02:49,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:49,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-28 13:02:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:49,477 INFO L225 Difference]: With dead ends: 63 [2018-11-28 13:02:49,477 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 13:02:49,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:02:49,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 13:02:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 13:02:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 13:02:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-28 13:02:49,481 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 21 [2018-11-28 13:02:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:49,481 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-28 13:02:49,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:02:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-28 13:02:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:02:49,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:49,482 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, 1] [2018-11-28 13:02:49,482 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:49,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash -306382864, now seen corresponding path program 1 times [2018-11-28 13:02:49,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:49,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:49,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:49,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:49,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:49,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:49,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:49,630 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:02:49,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-11-28 13:02:49,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,672 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 13 treesize of output 10 [2018-11-28 13:02:49,675 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-11-28 13:02:49,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:49,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-11-28 13:02:49,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,731 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-11-28 13:02:49,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:49,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:49,783 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:49,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:49,811 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 51 [2018-11-28 13:02:49,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:49,819 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 16 treesize of output 23 [2018-11-28 13:02:49,820 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,833 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 52 treesize of output 46 [2018-11-28 13:02:49,836 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-11-28 13:02:49,837 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:49,850 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:49,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 73 [2018-11-28 13:02:49,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 87 [2018-11-28 13:02:49,872 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 13:02:49,912 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:49,923 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:49,934 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:02:49,958 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2018-11-28 13:02:49,999 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-11-28 13:02:49,999 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,008 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 28 treesize of output 22 [2018-11-28 13:02:50,010 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 22 treesize of output 13 [2018-11-28 13:02:50,010 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,014 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,020 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,022 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-11-28 13:02:50,041 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-11-28 13:02:50,042 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,050 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 15 treesize of output 11 [2018-11-28 13:02:50,052 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-11-28 13:02:50,053 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,055 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,060 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,076 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:105, output treesize:14 [2018-11-28 13:02:50,093 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 23 treesize of output 24 [2018-11-28 13:02:50,094 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-11-28 13:02:50,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,104 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-11-28 13:02:50,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-11-28 13:02:50,144 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 28 treesize of output 26 [2018-11-28 13:02:50,149 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 7 treesize of output 1 [2018-11-28 13:02:50,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,159 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 15 treesize of output 3 [2018-11-28 13:02:50,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:50,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-28 13:02:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:50,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:50,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-28 13:02:50,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:02:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:02:50,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:02:50,187 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2018-11-28 13:02:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:50,775 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-11-28 13:02:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:02:50,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-28 13:02:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:50,776 INFO L225 Difference]: With dead ends: 107 [2018-11-28 13:02:50,776 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 13:02:50,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:02:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 13:02:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-28 13:02:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 13:02:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-28 13:02:50,782 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 25 [2018-11-28 13:02:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:50,782 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-28 13:02:50,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:02:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-28 13:02:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 13:02:50,783 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:50,783 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, 1, 1, 1, 1] [2018-11-28 13:02:50,784 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:50,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1987060883, now seen corresponding path program 1 times [2018-11-28 13:02:50,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:50,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:50,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:50,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:50,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:51,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:51,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:51,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:51,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:51,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:02:51,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-11-28 13:02:51,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:51,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2018-11-28 13:02:51,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,154 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-11-28 13:02:51,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,185 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-11-28 13:02:51,201 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-11-28 13:02:51,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,214 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 42 treesize of output 38 [2018-11-28 13:02:51,217 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-11-28 13:02:51,217 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,234 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-28 13:02:51,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,238 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 14 treesize of output 47 [2018-11-28 13:02:51,239 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,248 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,255 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,275 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-11-28 13:02:51,300 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 11 [2018-11-28 13:02:51,300 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,327 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-28 13:02:51,329 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-11-28 13:02:51,330 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,342 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 56 treesize of output 63 [2018-11-28 13:02:51,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,345 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 18 treesize of output 35 [2018-11-28 13:02:51,346 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,354 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,360 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,367 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,377 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:191, output treesize:71 [2018-11-28 13:02:51,409 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 33 treesize of output 26 [2018-11-28 13:02:51,411 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 26 treesize of output 25 [2018-11-28 13:02:51,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,433 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 185 treesize of output 182 [2018-11-28 13:02:51,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 99 [2018-11-28 13:02:51,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,472 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 149 treesize of output 109 [2018-11-28 13:02:51,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,476 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 143 [2018-11-28 13:02:51,477 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,494 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:212, output treesize:94 [2018-11-28 13:02:51,548 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 101 treesize of output 67 [2018-11-28 13:02:51,550 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 53 treesize of output 40 [2018-11-28 13:02:51,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,562 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 43 treesize of output 32 [2018-11-28 13:02:51,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,578 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 46 treesize of output 38 [2018-11-28 13:02:51,580 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 29 treesize of output 18 [2018-11-28 13:02:51,580 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:51,590 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 11 treesize of output 8 [2018-11-28 13:02:51,591 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,595 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,599 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:108, output treesize:13 [2018-11-28 13:02:51,617 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-11-28 13:02:51,621 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-11-28 13:02:51,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:51,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 13:02:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:51,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:51,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-11-28 13:02:51,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:02:51,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:02:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:02:51,659 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 19 states. [2018-11-28 13:02:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:52,518 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-28 13:02:52,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:02:52,519 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-11-28 13:02:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:52,520 INFO L225 Difference]: With dead ends: 115 [2018-11-28 13:02:52,520 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 13:02:52,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-11-28 13:02:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 13:02:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2018-11-28 13:02:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 13:02:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-11-28 13:02:52,525 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 32 [2018-11-28 13:02:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:52,526 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-11-28 13:02:52,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:02:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-11-28 13:02:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 13:02:52,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:52,526 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, 1, 1, 1, 1] [2018-11-28 13:02:52,526 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:52,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2121074389, now seen corresponding path program 1 times [2018-11-28 13:02:52,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:52,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:52,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:52,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:52,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:52,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:52,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:52,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:52,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:52,684 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:02:52,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-11-28 13:02:52,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:52,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2018-11-28 13:02:52,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:52,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:52,728 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-11-28 13:02:52,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,760 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 57 [2018-11-28 13:02:52,776 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-11-28 13:02:52,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,790 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 46 treesize of output 40 [2018-11-28 13:02:52,793 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-11-28 13:02:52,793 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,811 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-28 13:02:52,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:52,816 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 16 treesize of output 53 [2018-11-28 13:02:52,816 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,828 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,866 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 84 [2018-11-28 13:02:52,904 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 14 treesize of output 13 [2018-11-28 13:02:52,905 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,928 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 78 [2018-11-28 13:02:52,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 10 treesize of output 9 [2018-11-28 13:02:52,935 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:52,952 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 64 treesize of output 73 [2018-11-28 13:02:52,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:52,957 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 20 treesize of output 41 [2018-11-28 13:02:52,957 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,967 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,974 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:52,981 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:53,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:53,001 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:212, output treesize:111 [2018-11-28 13:02:53,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,047 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 20 treesize of output 21 [2018-11-28 13:02:53,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:53,254 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 784 treesize of output 624 [2018-11-28 13:02:53,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 592 treesize of output 812 [2018-11-28 13:02:53,300 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:53,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:53,554 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:53,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:53,759 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 0 case distinctions, treesize of input 726 treesize of output 483 [2018-11-28 13:02:53,886 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 13:02:53,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 72 treesize of output 150 [2018-11-28 13:02:53,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:53,916 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:53,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 74 treesize of output 145 [2018-11-28 13:02:53,924 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:53,942 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,001 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 437 treesize of output 455 [2018-11-28 13:02:54,004 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 22 treesize of output 21 [2018-11-28 13:02:54,004 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,037 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:54,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 452 [2018-11-28 13:02:54,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,060 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 67 [2018-11-28 13:02:54,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 126 [2018-11-28 13:02:54,070 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,080 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,105 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,125 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,145 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,195 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 461 treesize of output 250 [2018-11-28 13:02:54,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 204 [2018-11-28 13:02:54,260 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,295 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 232 [2018-11-28 13:02:54,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 13:02:54,300 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,330 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:54,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 227 [2018-11-28 13:02:54,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 212 [2018-11-28 13:02:54,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 247 [2018-11-28 13:02:54,359 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,376 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,399 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,418 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,436 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:54,458 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:798, output treesize:200 [2018-11-28 13:02:54,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 125 [2018-11-28 13:02:54,599 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 45 treesize of output 30 [2018-11-28 13:02:54,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,617 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 26 treesize of output 23 [2018-11-28 13:02:54,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:54,628 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 22 treesize of output 14 [2018-11-28 13:02:54,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:54,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:309, output treesize:121 [2018-11-28 13:02:54,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 59 [2018-11-28 13:02:54,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-11-28 13:02:54,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 20 [2018-11-28 13:02:54,697 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 13:02:54,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:54,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:4 [2018-11-28 13:02:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:54,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:54,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-28 13:02:54,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 13:02:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 13:02:54,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:02:54,740 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 15 states. [2018-11-28 13:02:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:55,478 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-11-28 13:02:55,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:02:55,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-28 13:02:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:55,486 INFO L225 Difference]: With dead ends: 111 [2018-11-28 13:02:55,486 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 13:02:55,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-11-28 13:02:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 13:02:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 84. [2018-11-28 13:02:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-28 13:02:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-11-28 13:02:55,494 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 32 [2018-11-28 13:02:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:55,495 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-11-28 13:02:55,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 13:02:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-11-28 13:02:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:02:55,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:55,495 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:55,496 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:55,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2122609175, now seen corresponding path program 2 times [2018-11-28 13:02:55,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:55,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:55,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:55,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:55,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:55,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:02:55,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:02:55,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:02:55,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:55,728 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:02:55,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-11-28 13:02:55,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:55,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2018-11-28 13:02:55,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:55,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:55,789 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-11-28 13:02:55,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,842 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-11-28 13:02:55,877 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-11-28 13:02:55,878 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,920 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 42 treesize of output 38 [2018-11-28 13:02:55,923 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-11-28 13:02:55,923 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,954 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-28 13:02:55,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:55,958 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 14 treesize of output 47 [2018-11-28 13:02:55,958 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,966 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,973 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:55,995 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-11-28 13:02:56,019 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 11 [2018-11-28 13:02:56,020 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,037 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-28 13:02:56,039 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-11-28 13:02:56,039 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,050 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 56 treesize of output 63 [2018-11-28 13:02:56,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,053 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:56,053 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 18 treesize of output 46 [2018-11-28 13:02:56,053 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,060 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,066 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,071 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,082 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:197, output treesize:92 [2018-11-28 13:02:56,104 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 101 treesize of output 90 [2018-11-28 13:02:56,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2018-11-28 13:02:56,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,144 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-11-28 13:02:56,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 82 [2018-11-28 13:02:56,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:84 [2018-11-28 13:02:56,263 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 83 [2018-11-28 13:02:56,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,267 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:56,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2018-11-28 13:02:56,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,281 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-28 13:02:56,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:56,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:56,295 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 37 treesize of output 29 [2018-11-28 13:02:56,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:56,297 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 20 treesize of output 10 [2018-11-28 13:02:56,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,302 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-11-28 13:02:56,302 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,308 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:125, output treesize:10 [2018-11-28 13:02:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:56,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:56,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-28 13:02:56,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:02:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:02:56,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:02:56,335 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 17 states. [2018-11-28 13:02:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:56,741 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-11-28 13:02:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:02:56,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-11-28 13:02:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:56,743 INFO L225 Difference]: With dead ends: 100 [2018-11-28 13:02:56,743 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 13:02:56,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:02:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 13:02:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-28 13:02:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 13:02:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-11-28 13:02:56,748 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 35 [2018-11-28 13:02:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:56,748 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-28 13:02:56,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:02:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-28 13:02:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:02:56,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:56,750 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:56,750 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:56,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash -249130087, now seen corresponding path program 2 times [2018-11-28 13:02:56,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:56,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:56,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:02:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:56,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:56,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:02:56,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:02:56,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:02:56,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:02:56,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:56,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 13:02:56,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-11-28 13:02:56,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:56,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2018-11-28 13:02:57,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:57,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:57,031 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-11-28 13:02:57,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,071 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-11-28 13:02:57,086 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-11-28 13:02:57,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,100 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 42 treesize of output 38 [2018-11-28 13:02:57,102 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-11-28 13:02:57,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-28 13:02:57,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:57,121 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 14 treesize of output 47 [2018-11-28 13:02:57,121 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,130 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,137 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,144 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,161 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-11-28 13:02:57,193 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 11 [2018-11-28 13:02:57,193 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,215 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-28 13:02:57,217 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-11-28 13:02:57,217 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:57,231 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 56 treesize of output 63 [2018-11-28 13:02:57,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:57,236 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:57,236 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 18 treesize of output 46 [2018-11-28 13:02:57,236 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,245 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,253 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,260 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,277 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:203, output treesize:102 [2018-11-28 13:02:57,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:57,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:57,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:57,376 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 20 treesize of output 21 [2018-11-28 13:02:57,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:57,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:57,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,095 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,311 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 0 case distinctions, treesize of input 3146 treesize of output 2201 [2018-11-28 13:02:58,666 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2018-11-28 13:02:58,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 64 treesize of output 130 [2018-11-28 13:02:58,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 66 treesize of output 139 [2018-11-28 13:02:58,716 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:58,753 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:58,854 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 2001 treesize of output 2017 [2018-11-28 13:02:58,859 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-11-28 13:02:58,859 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:58,936 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:58,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1980 treesize of output 1892 [2018-11-28 13:02:58,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,992 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 250 [2018-11-28 13:02:58,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 327 [2018-11-28 13:02:59,008 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:59,033 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:59,091 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:59,148 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:59,204 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:59,297 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:59,302 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:59,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-11-28 13:02:59,395 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-11-28 13:02:59,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,403 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 64 treesize of output 56 [2018-11-28 13:02:59,403 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:59,412 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:59,417 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:59,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1540 treesize of output 566 [2018-11-28 13:02:59,679 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2018-11-28 13:02:59,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 468 [2018-11-28 13:02:59,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 465 treesize of output 630 [2018-11-28 13:02:59,711 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:59,756 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:59,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 552 treesize of output 456 [2018-11-28 13:02:59,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-28 13:02:59,812 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:59,860 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:59,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 512 [2018-11-28 13:02:59,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,902 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 550 treesize of output 546 [2018-11-28 13:02:59,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:59,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 539 treesize of output 609 [2018-11-28 13:02:59,929 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-28 13:03:00,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 415 treesize of output 527 [2018-11-28 13:03:00,279 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,337 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,365 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,388 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,411 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,443 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 0 case distinctions, treesize of input 157 treesize of output 157 [2018-11-28 13:03:00,446 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-11-28 13:03:00,446 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,462 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 154 [2018-11-28 13:03:00,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,466 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 98 treesize of output 52 [2018-11-28 13:03:00,467 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,473 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,477 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,505 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 144 [2018-11-28 13:03:00,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,508 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 91 treesize of output 135 [2018-11-28 13:03:00,508 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,517 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:00,537 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 10 variables, input treesize:2496, output treesize:210 [2018-11-28 13:03:00,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 169 [2018-11-28 13:03:00,628 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 106 treesize of output 99 [2018-11-28 13:03:00,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:00,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 128 treesize of output 101 [2018-11-28 13:03:00,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:00,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 12 treesize of output 4 [2018-11-28 13:03:00,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:00,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,695 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 85 treesize of output 73 [2018-11-28 13:03:00,696 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 51 treesize of output 36 [2018-11-28 13:03:00,697 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,708 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 13 treesize of output 12 [2018-11-28 13:03:00,708 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-28 13:03:00,716 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:00,725 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:282, output treesize:22 [2018-11-28 13:03:00,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:00,745 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-11-28 13:03:00,749 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 10 treesize of output 15 [2018-11-28 13:03:00,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,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, 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-11-28 13:03:00,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:00,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-11-28 13:03:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:00,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:00,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-11-28 13:03:00,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 13:03:00,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 13:03:00,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:03:00,791 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-11-28 13:03:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:01,663 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-28 13:03:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:03:01,663 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-11-28 13:03:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:01,664 INFO L225 Difference]: With dead ends: 128 [2018-11-28 13:03:01,664 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 13:03:01,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-11-28 13:03:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 13:03:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-11-28 13:03:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 13:03:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-11-28 13:03:01,674 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 35 [2018-11-28 13:03:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:01,674 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-28 13:03:01,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 13:03:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-28 13:03:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:03:01,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:01,675 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:01,676 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:01,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1364216251, now seen corresponding path program 1 times [2018-11-28 13:03:01,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:01,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:01,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:01,740 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:03:01,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:03:01 BoogieIcfgContainer [2018-11-28 13:03:01,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:03:01,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:03:01,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:03:01,773 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:03:01,773 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:02:47" (3/4) ... [2018-11-28 13:03:01,775 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:03:01,814 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3aed4c3c-f76a-4ce7-9fd7-4846013ee9f6/bin-2019/uautomizer/witness.graphml [2018-11-28 13:03:01,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:03:01,815 INFO L168 Benchmark]: Toolchain (without parser) took 14769.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.0 MB). Free memory was 950.6 MB in the beginning and 1.4 GB in the end (delta: -408.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:01,815 INFO L168 Benchmark]: CDTParser took 0.11 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-11-28 13:03:01,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:01,816 INFO L168 Benchmark]: Boogie Preprocessor took 28.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,816 INFO L168 Benchmark]: RCFGBuilder took 407.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,816 INFO L168 Benchmark]: TraceAbstraction took 13927.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -265.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:01,817 INFO L168 Benchmark]: Witness Printer took 41.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,818 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.11 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 335.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 407.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13927.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -265.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 41.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1021] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next VAL [end={36:0}, end->next={33:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1031] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={34:0}, end->colour=0, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1038] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, null={33:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 7 error locations. UNSAFE Result, 13.8s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 448 SDtfs, 736 SDslu, 2021 SDs, 0 SdLazy, 1683 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 165 SyntacticMatches, 9 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred 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, 131 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 438 ConstructedInterpolants, 59 QuantifiedInterpolants, 542113 SizeOfPredicates, 84 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 11/60 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...