./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no XNF --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:19:02,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:19:02,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:19:02,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:19:02,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:19:02,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:19:02,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:19:02,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:19:02,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:19:02,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:19:02,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:19:02,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:19:02,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:19:02,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:19:02,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:19:02,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:19:02,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:19:02,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:19:02,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:19:02,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:19:02,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:19:02,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:19:02,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:19:02,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:19:02,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:19:02,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:19:02,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:19:02,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:19:02,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:19:02,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:19:02,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:19:02,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:19:02,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:19:02,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:19:02,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:19:02,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:19:02,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:19:02,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:19:02,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:19:02,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:19:02,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:19:02,210 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 02:19:02,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:19:02,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:19:02,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:19:02,245 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:19:02,246 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:19:02,246 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:19:02,246 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:19:02,246 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:19:02,247 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:19:02,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:19:02,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:19:02,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:19:02,248 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:19:02,248 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:19:02,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:19:02,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:19:02,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:19:02,249 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:19:02,250 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:19:02,250 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 02:19:02,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:19:02,250 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:19:02,251 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:19:02,251 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:19:02,251 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:19:02,251 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:19:02,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:19:02,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:19:02,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:19:02,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:19:02,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:19:02,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:19:02,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:19:02,254 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:19:02,254 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:19:02,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:19:02,255 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 [2019-11-26 02:19:02,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:19:02,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:19:02,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:19:02,426 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:19:02,426 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:19:02,427 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-26 02:19:02,472 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/data/dd25a7b3b/0dd95ce340cc4cbf90bd86fdf0c8cf65/FLAG92b2cf0c0 [2019-11-26 02:19:02,939 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:19:02,939 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-26 02:19:02,954 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/data/dd25a7b3b/0dd95ce340cc4cbf90bd86fdf0c8cf65/FLAG92b2cf0c0 [2019-11-26 02:19:03,445 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/data/dd25a7b3b/0dd95ce340cc4cbf90bd86fdf0c8cf65 [2019-11-26 02:19:03,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:19:03,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:19:03,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:19:03,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:19:03,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:19:03,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eeadd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03, skipping insertion in model container [2019-11-26 02:19:03,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:19:03,503 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:19:03,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:19:03,829 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:19:03,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:19:03,923 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:19:03,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03 WrapperNode [2019-11-26 02:19:03,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:19:03,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:19:03,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:19:03,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:19:03,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:19:03,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:19:03,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:19:03,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:19:03,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:03,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... [2019-11-26 02:19:04,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:19:04,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:19:04,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:19:04,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:19:04,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:19:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:19:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:19:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:19:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:19:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:19:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 02:19:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:19:04,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:19:04,556 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:19:04,557 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-26 02:19:04,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:19:04 BoogieIcfgContainer [2019-11-26 02:19:04,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:19:04,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:19:04,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:19:04,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:19:04,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:19:03" (1/3) ... [2019-11-26 02:19:04,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ab3608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:19:04, skipping insertion in model container [2019-11-26 02:19:04,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:19:03" (2/3) ... [2019-11-26 02:19:04,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ab3608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:19:04, skipping insertion in model container [2019-11-26 02:19:04,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:19:04" (3/3) ... [2019-11-26 02:19:04,570 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2019-11-26 02:19:04,579 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:19:04,586 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2019-11-26 02:19:04,596 INFO L249 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2019-11-26 02:19:04,617 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:19:04,618 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:19:04,618 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:19:04,618 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:19:04,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:19:04,618 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:19:04,618 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:19:04,618 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:19:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-26 02:19:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 02:19:04,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:04,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 02:19:04,638 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-11-26 02:19:04,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:04,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1823087709] [2019-11-26 02:19:04,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:04,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:19:04,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:04,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:19:04,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:04,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:04,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:04,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:19:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:04,820 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:04,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1823087709] [2019-11-26 02:19:04,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:19:04,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:19:04,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087988762] [2019-11-26 02:19:04,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:19:04,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:19:04,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:19:04,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:19:04,850 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2019-11-26 02:19:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:19:05,031 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-26 02:19:05,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:19:05,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-26 02:19:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:19:05,041 INFO L225 Difference]: With dead ends: 72 [2019-11-26 02:19:05,042 INFO L226 Difference]: Without dead ends: 66 [2019-11-26 02:19:05,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:19:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-26 02:19:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2019-11-26 02:19:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-26 02:19:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-11-26 02:19:05,076 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 4 [2019-11-26 02:19:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:19:05,077 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-11-26 02:19:05,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:19:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-11-26 02:19:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 02:19:05,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:05,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 02:19:05,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:05,280 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:05,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:05,280 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-11-26 02:19:05,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:05,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [601529852] [2019-11-26 02:19:05,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:05,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:19:05,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:05,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:19:05,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:05,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:05,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:05,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:19:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:05,424 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:05,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [601529852] [2019-11-26 02:19:05,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:19:05,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:19:05,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457352980] [2019-11-26 02:19:05,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:19:05,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:19:05,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:19:05,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:19:05,459 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 4 states. [2019-11-26 02:19:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:19:05,577 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-11-26 02:19:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:19:05,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-26 02:19:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:19:05,579 INFO L225 Difference]: With dead ends: 49 [2019-11-26 02:19:05,579 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 02:19:05,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:19:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 02:19:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-26 02:19:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-26 02:19:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-11-26 02:19:05,586 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 4 [2019-11-26 02:19:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:19:05,586 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-11-26 02:19:05,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:19:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-11-26 02:19:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:19:05,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:05,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:19:05,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:05,788 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000980, now seen corresponding path program 1 times [2019-11-26 02:19:05,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:05,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1203023081] [2019-11-26 02:19:05,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:05,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:19:05,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:05,929 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:05,929 INFO L377 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-26 02:19:05,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:05,958 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-26 02:19:05,959 INFO L496 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. [2019-11-26 02:19:05,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-26 02:19:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:05,975 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:05,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1203023081] [2019-11-26 02:19:05,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:19:05,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2019-11-26 02:19:05,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924487660] [2019-11-26 02:19:05,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:19:05,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:19:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:19:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:19:05,986 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 4 states. [2019-11-26 02:19:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:19:06,228 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-11-26 02:19:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:19:06,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-26 02:19:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:19:06,230 INFO L225 Difference]: With dead ends: 81 [2019-11-26 02:19:06,230 INFO L226 Difference]: Without dead ends: 81 [2019-11-26 02:19:06,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:19:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-26 02:19:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 47. [2019-11-26 02:19:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-26 02:19:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-11-26 02:19:06,236 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 9 [2019-11-26 02:19:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:19:06,236 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-11-26 02:19:06,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:19:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-11-26 02:19:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:19:06,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:06,237 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:19:06,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:06,438 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:06,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:06,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000981, now seen corresponding path program 1 times [2019-11-26 02:19:06,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:06,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [907928857] [2019-11-26 02:19:06,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:06,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:19:06,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:06,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:19:06,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:06,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:06,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:06,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:19:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:06,561 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:06,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [907928857] [2019-11-26 02:19:06,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:19:06,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:19:06,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361974132] [2019-11-26 02:19:06,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:19:06,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:19:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:19:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:19:06,597 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 4 states. [2019-11-26 02:19:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:19:06,860 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2019-11-26 02:19:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:19:06,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-26 02:19:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:19:06,862 INFO L225 Difference]: With dead ends: 80 [2019-11-26 02:19:06,862 INFO L226 Difference]: Without dead ends: 80 [2019-11-26 02:19:06,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:19:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-26 02:19:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 45. [2019-11-26 02:19:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-26 02:19:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-11-26 02:19:06,868 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 9 [2019-11-26 02:19:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:19:06,868 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-11-26 02:19:06,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:19:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-11-26 02:19:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:19:06,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:06,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:19:07,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:07,078 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:07,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1837803479, now seen corresponding path program 1 times [2019-11-26 02:19:07,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:07,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [783810948] [2019-11-26 02:19:07,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:07,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:19:07,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:07,191 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:07,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [783810948] [2019-11-26 02:19:07,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:19:07,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-26 02:19:07,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599009702] [2019-11-26 02:19:07,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:19:07,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:19:07,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:19:07,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:19:07,203 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 4 states. [2019-11-26 02:19:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:19:07,226 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-11-26 02:19:07,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:19:07,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-26 02:19:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:19:07,228 INFO L225 Difference]: With dead ends: 51 [2019-11-26 02:19:07,228 INFO L226 Difference]: Without dead ends: 51 [2019-11-26 02:19:07,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:19:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-26 02:19:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-26 02:19:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-26 02:19:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-11-26 02:19:07,233 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 11 [2019-11-26 02:19:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:19:07,233 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-11-26 02:19:07,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:19:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-11-26 02:19:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:19:07,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:07,235 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:19:07,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:07,437 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash 760120087, now seen corresponding path program 1 times [2019-11-26 02:19:07,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:07,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1910777042] [2019-11-26 02:19:07,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:07,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:19:07,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:07,607 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:07,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1910777042] [2019-11-26 02:19:07,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61113981] [2019-11-26 02:19:07,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:19:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:07,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:19:07,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:07,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:19:07,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:07,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:07,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:07,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:19:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:19:07,822 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:19:07,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:19:07,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5] total 12 [2019-11-26 02:19:07,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456967661] [2019-11-26 02:19:07,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:19:07,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:19:07,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:19:07,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:19:07,846 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 6 states. [2019-11-26 02:19:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:19:08,238 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-11-26 02:19:08,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:19:08,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-26 02:19:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:19:08,239 INFO L225 Difference]: With dead ends: 61 [2019-11-26 02:19:08,239 INFO L226 Difference]: Without dead ends: 61 [2019-11-26 02:19:08,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:19:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-26 02:19:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2019-11-26 02:19:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-26 02:19:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-26 02:19:08,244 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 21 [2019-11-26 02:19:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:19:08,244 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-26 02:19:08,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:19:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-26 02:19:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:19:08,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:08,245 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:19:08,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:19:08,647 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash 760120088, now seen corresponding path program 1 times [2019-11-26 02:19:08,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:08,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1903696835] [2019-11-26 02:19:08,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:08,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:19:08,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:08,812 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:19:08,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1903696835] [2019-11-26 02:19:08,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745458386] [2019-11-26 02:19:08,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:19:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:08,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-26 02:19:08,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:08,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:19:08,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:08,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:08,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:08,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:19:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:19:09,068 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:19:09,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:19:09,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 7] imperfect sequences [5, 5] total 18 [2019-11-26 02:19:09,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660252692] [2019-11-26 02:19:09,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:19:09,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:19:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:19:09,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:19:09,727 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 12 states. [2019-11-26 02:19:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:19:10,413 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-11-26 02:19:10,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:19:10,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-26 02:19:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:19:10,414 INFO L225 Difference]: With dead ends: 51 [2019-11-26 02:19:10,414 INFO L226 Difference]: Without dead ends: 51 [2019-11-26 02:19:10,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:19:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-26 02:19:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-26 02:19:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-26 02:19:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-11-26 02:19:10,418 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 21 [2019-11-26 02:19:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:19:10,418 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-11-26 02:19:10,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:19:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-11-26 02:19:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 02:19:10,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:10,419 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:19:10,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:19:10,822 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1057123719, now seen corresponding path program 1 times [2019-11-26 02:19:10,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:10,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [814023006] [2019-11-26 02:19:10,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:10,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:19:10,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:19:10,996 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:19:11,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [814023006] [2019-11-26 02:19:11,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233409565] [2019-11-26 02:19:11,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:19:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:11,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:19:11,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:19:11,131 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:19:11,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:19:11,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2019-11-26 02:19:11,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025548664] [2019-11-26 02:19:11,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:19:11,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:19:11,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:19:11,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:19:11,214 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 10 states. [2019-11-26 02:19:11,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:19:11,392 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-26 02:19:11,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:19:11,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-26 02:19:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:19:11,394 INFO L225 Difference]: With dead ends: 70 [2019-11-26 02:19:11,394 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 02:19:11,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:19:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 02:19:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-26 02:19:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:19:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-26 02:19:11,403 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 27 [2019-11-26 02:19:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:19:11,403 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-26 02:19:11,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:19:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-26 02:19:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:19:11,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:11,405 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:19:11,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:11,810 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:11,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1809332025, now seen corresponding path program 2 times [2019-11-26 02:19:11,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:11,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [483290977] [2019-11-26 02:19:11,811 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:12,030 ERROR L271 FreeRefinementEngine]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2019-11-26 02:19:12,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379112896] [2019-11-26 02:19:12,037 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:19:12,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:19:12,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:19:12,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-26 02:19:12,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:12,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:19:12,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:12,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-26 02:19:12,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:12,310 INFO L377 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-26 02:19:12,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,342 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-26 02:19:12,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:20 [2019-11-26 02:19:12,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-26 02:19:12,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,402 INFO L567 ElimStorePlain]: treesize reduction 3, result has 92.9 percent of original size [2019-11-26 02:19:12,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-26 02:19:12,406 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:12,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:32 [2019-11-26 02:19:12,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:19:12,477 INFO L377 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 31 treesize of output 15 [2019-11-26 02:19:12,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,542 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.7 percent of original size [2019-11-26 02:19:12,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:19:12,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-26 02:19:12,552 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:12,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:30 [2019-11-26 02:19:12,650 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:12,650 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-26 02:19:12,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:12,689 INFO L567 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-11-26 02:19:12,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:12,707 INFO L377 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 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-26 02:19:12,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:12,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:12,712 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:12,784 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2019-11-26 02:19:12,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:12,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:12,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-11-26 02:19:12,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:12,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:13,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:19:13,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:13,036 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 29 [2019-11-26 02:19:13,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:13,155 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-26 02:19:13,156 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-11-26 02:19:13,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:19:13,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:13,172 INFO L377 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 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-26 02:19:13,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:13,230 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-11-26 02:19:13,230 INFO L496 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. [2019-11-26 02:19:13,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:49 [2019-11-26 02:19:13,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:13,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 20 [2019-11-26 02:19:13,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:13,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:13,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:13,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 18 [2019-11-26 02:19:13,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:13,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:13,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:13,322 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:19 [2019-11-26 02:19:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:19:13,442 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:13,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:13,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:13,612 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:13,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:13,666 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:13,669 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:13,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:13,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-26 02:19:13,686 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:57 [2019-11-26 02:19:13,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:14,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:14,040 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:14,044 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:14,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:14,082 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:14,085 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:14,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:14,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-26 02:19:14,105 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:71 [2019-11-26 02:19:14,194 INFO L377 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 45 treesize of output 41 [2019-11-26 02:19:14,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:19:14,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:19:14,205 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:14,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:14,219 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:14,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:14,272 INFO L377 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 45 treesize of output 43 [2019-11-26 02:19:14,275 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:19:14,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:19:14,279 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:14,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:14,294 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:14,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:14,333 INFO L377 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 33 treesize of output 31 [2019-11-26 02:19:14,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:19:14,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:19:14,343 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:14,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:14,352 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:14,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:14,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-26 02:19:14,376 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:91, output treesize:43 [2019-11-26 02:19:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:19:14,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [483290977] [2019-11-26 02:19:14,576 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:19:14,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379112896] [2019-11-26 02:19:14,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:19:14,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-11-26 02:19:14,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965446479] [2019-11-26 02:19:14,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-26 02:19:14,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:19:14,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-26 02:19:14,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-11-26 02:19:14,578 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 25 states. [2019-11-26 02:19:15,696 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-11-26 02:19:15,920 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-11-26 02:19:16,282 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2019-11-26 02:19:16,473 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-11-26 02:19:16,726 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-11-26 02:19:17,193 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-26 02:19:17,443 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-11-26 02:19:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:19:18,002 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-11-26 02:19:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 02:19:18,002 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-11-26 02:19:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:19:18,005 INFO L225 Difference]: With dead ends: 121 [2019-11-26 02:19:18,005 INFO L226 Difference]: Without dead ends: 121 [2019-11-26 02:19:18,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2019-11-26 02:19:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-26 02:19:18,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. [2019-11-26 02:19:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-26 02:19:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2019-11-26 02:19:18,011 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 37 [2019-11-26 02:19:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:19:18,012 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2019-11-26 02:19:18,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-26 02:19:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2019-11-26 02:19:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:19:18,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:19:18,013 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:19:18,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:19:18,227 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:19:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:19:18,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1809332024, now seen corresponding path program 1 times [2019-11-26 02:19:18,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:19:18,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1801081508] [2019-11-26 02:19:18,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee298dfe-2303-4357-9dd8-5253cca94ca5/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:19:18,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-26 02:19:18,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:19:18,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:19:18,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:18,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-26 02:19:18,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:18,583 INFO L377 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-26 02:19:18,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,608 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-26 02:19:18,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-26 02:19:18,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-26 02:19:18,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:18,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-26 02:19:18,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:18,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:30 [2019-11-26 02:19:18,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:19:18,697 INFO L377 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 31 treesize of output 15 [2019-11-26 02:19:18,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:18,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:19:18,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-26 02:19:18,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:18,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,750 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:30 [2019-11-26 02:19:18,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:18,800 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 38 [2019-11-26 02:19:18,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:18,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:18,802 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:18,851 INFO L567 ElimStorePlain]: treesize reduction 12, result has 81.3 percent of original size [2019-11-26 02:19:18,868 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:18,869 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-26 02:19:18,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:18,913 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.0 percent of original size [2019-11-26 02:19:18,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:18,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:18,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2019-11-26 02:19:18,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:18,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:19,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:19:19,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:19,077 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 29 [2019-11-26 02:19:19,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:19,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:19,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:19:19,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:19,116 INFO L377 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 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-26 02:19:19,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:19,160 INFO L567 ElimStorePlain]: treesize reduction 16, result has 74.6 percent of original size [2019-11-26 02:19:19,160 INFO L496 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. [2019-11-26 02:19:19,160 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:47 [2019-11-26 02:19:19,182 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:19,182 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 20 [2019-11-26 02:19:19,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:19,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:19,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:19,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 18 [2019-11-26 02:19:19,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:19,242 INFO L567 ElimStorePlain]: treesize reduction 8, result has 78.4 percent of original size [2019-11-26 02:19:19,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:19:19,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:21 [2019-11-26 02:19:19,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:19:19,343 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:19:19,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:19:19,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:19,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:19,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:19,686 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,696 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,704 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,712 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,718 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,726 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:19,822 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:19,831 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,836 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,844 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:19,850 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,854 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:19,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:19,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-26 02:19:19,915 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:367, output treesize:207 [2019-11-26 02:19:20,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:20,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:19:20,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:19:20,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:20,664 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:20,685 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:20,710 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:20,725 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:20,738 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:21,386 WARN L192 SmtUtils]: Spent 647.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-26 02:19:21,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:21,402 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:21,416 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:21,425 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:21,446 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:21,492 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:21,510 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:19:22,256 WARN L192 SmtUtils]: Spent 745.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-26 02:19:22,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:19:22,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-26 02:19:22,258 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:495, output treesize:575 [2019-11-26 02:19:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:19:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:19:23,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:23,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:23,063 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:23,072 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:23,402 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-26 02:19:23,403 INFO L567 ElimStorePlain]: treesize reduction 114, result has 78.3 percent of original size [2019-11-26 02:19:23,414 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:23,424 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:23,438 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:23,451 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-26 02:19:23,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:19:23,652 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:19:23,655 INFO L168 Benchmark]: Toolchain (without parser) took 20206.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:19:23,655 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:19:23,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:19:23,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.05 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:19:23,656 INFO L168 Benchmark]: Boogie Preprocessor took 33.03 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. [2019-11-26 02:19:23,656 INFO L168 Benchmark]: RCFGBuilder took 555.33 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:19:23,656 INFO L168 Benchmark]: TraceAbstraction took 19095.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 84.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:19:23,658 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 474.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.05 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.03 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. * RCFGBuilder took 555.33 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19095.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 84.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...