./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b9ae191666cff52a5646f600ca779e3fb8cdedc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:43:15,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:43:15,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:43:15,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:43:15,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:43:15,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:43:15,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:43:15,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:43:15,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:43:15,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:43:15,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:43:15,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:43:15,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:43:15,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:43:15,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:43:15,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:43:15,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:43:15,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:43:15,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:43:15,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:43:15,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:43:15,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:43:15,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:43:15,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:43:15,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:43:15,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:43:15,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:43:15,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:43:15,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:43:15,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:43:15,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:43:15,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:43:15,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:43:15,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:43:15,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:43:15,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:43:15,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:43:15,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:43:15,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:43:15,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:43:15,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:43:15,369 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:43:15,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:43:15,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:43:15,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:43:15,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:43:15,384 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:43:15,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:43:15,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:43:15,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:43:15,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:43:15,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:43:15,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:43:15,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:43:15,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:43:15,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:43:15,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:43:15,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:43:15,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:43:15,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:43:15,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:43:15,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:43:15,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:43:15,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:43:15,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:43:15,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:43:15,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:43:15,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:43:15,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:43:15,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:43:15,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b9ae191666cff52a5646f600ca779e3fb8cdedc [2019-11-15 23:43:15,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:43:15,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:43:15,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:43:15,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:43:15,449 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:43:15,449 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/../../sv-benchmarks/c/list-properties/list_search-1.i [2019-11-15 23:43:15,508 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/data/197ddf572/0268de0f7f0c4623beb3f51eed0a1dd6/FLAG396c4bb14 [2019-11-15 23:43:16,000 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:43:16,001 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/sv-benchmarks/c/list-properties/list_search-1.i [2019-11-15 23:43:16,013 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/data/197ddf572/0268de0f7f0c4623beb3f51eed0a1dd6/FLAG396c4bb14 [2019-11-15 23:43:16,308 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/data/197ddf572/0268de0f7f0c4623beb3f51eed0a1dd6 [2019-11-15 23:43:16,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:43:16,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:43:16,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:43:16,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:43:16,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:43:16,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41310824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16, skipping insertion in model container [2019-11-15 23:43:16,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,331 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:43:16,367 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:43:16,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:43:16,708 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:43:16,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:43:16,800 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:43:16,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16 WrapperNode [2019-11-15 23:43:16,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:43:16,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:43:16,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:43:16,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:43:16,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:43:16,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:43:16,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:43:16,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:43:16,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... [2019-11-15 23:43:16,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:43:16,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:43:16,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:43:16,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:43:16,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:43:16,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:43:16,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:43:16,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:43:16,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:43:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:43:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:43:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:43:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:43:17,345 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:43:17,346 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-15 23:43:17,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:43:17 BoogieIcfgContainer [2019-11-15 23:43:17,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:43:17,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:43:17,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:43:17,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:43:17,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:43:16" (1/3) ... [2019-11-15 23:43:17,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edd4fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:43:17, skipping insertion in model container [2019-11-15 23:43:17,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:43:16" (2/3) ... [2019-11-15 23:43:17,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edd4fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:43:17, skipping insertion in model container [2019-11-15 23:43:17,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:43:17" (3/3) ... [2019-11-15 23:43:17,355 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2019-11-15 23:43:17,364 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:43:17,371 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:43:17,381 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:43:17,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:43:17,405 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:43:17,405 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:43:17,405 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:43:17,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:43:17,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:43:17,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:43:17,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:43:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-15 23:43:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:43:17,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:17,422 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:17,424 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:17,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash -332178203, now seen corresponding path program 1 times [2019-11-15 23:43:17,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:17,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968131597] [2019-11-15 23:43:17,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:17,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:17,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:17,646 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-15 23:43:17,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968131597] [2019-11-15 23:43:17,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:43:17,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:43:17,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700386041] [2019-11-15 23:43:17,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:43:17,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:17,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:43:17,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:43:17,666 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2019-11-15 23:43:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:17,751 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2019-11-15 23:43:17,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:43:17,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-15 23:43:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:17,761 INFO L225 Difference]: With dead ends: 49 [2019-11-15 23:43:17,761 INFO L226 Difference]: Without dead ends: 22 [2019-11-15 23:43:17,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:43:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-15 23:43:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-15 23:43:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 23:43:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-15 23:43:17,799 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-11-15 23:43:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:17,800 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 23:43:17,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:43:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-15 23:43:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:43:17,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:17,801 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:17,801 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:17,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1321983588, now seen corresponding path program 1 times [2019-11-15 23:43:17,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:17,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522546324] [2019-11-15 23:43:17,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:17,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:17,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:17,927 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-15 23:43:17,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522546324] [2019-11-15 23:43:17,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:43:17,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:43:17,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492746673] [2019-11-15 23:43:17,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:43:17,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:17,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:43:17,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:43:17,930 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-11-15 23:43:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:18,097 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-15 23:43:18,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:43:18,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-15 23:43:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:18,099 INFO L225 Difference]: With dead ends: 38 [2019-11-15 23:43:18,099 INFO L226 Difference]: Without dead ends: 30 [2019-11-15 23:43:18,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:43:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-15 23:43:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 23:43:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:43:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-15 23:43:18,106 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-11-15 23:43:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:18,106 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 23:43:18,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:43:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-15 23:43:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:43:18,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:18,107 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:18,107 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:18,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1379241890, now seen corresponding path program 1 times [2019-11-15 23:43:18,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:18,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266577250] [2019-11-15 23:43:18,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:18,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:18,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:18,262 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-15 23:43:18,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266577250] [2019-11-15 23:43:18,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:43:18,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:43:18,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147214910] [2019-11-15 23:43:18,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:43:18,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:18,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:43:18,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:43:18,265 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-11-15 23:43:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:18,457 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-15 23:43:18,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:43:18,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-15 23:43:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:18,460 INFO L225 Difference]: With dead ends: 30 [2019-11-15 23:43:18,460 INFO L226 Difference]: Without dead ends: 25 [2019-11-15 23:43:18,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:43:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-15 23:43:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-15 23:43:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 23:43:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-11-15 23:43:18,468 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2019-11-15 23:43:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:18,468 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-15 23:43:18,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:43:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-11-15 23:43:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:43:18,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:18,469 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:18,470 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash -633881513, now seen corresponding path program 1 times [2019-11-15 23:43:18,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:18,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965386988] [2019-11-15 23:43:18,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:18,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:18,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:18,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965386988] [2019-11-15 23:43:18,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626773117] [2019-11-15 23:43:18,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:18,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 23:43:18,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:18,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:43:18,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:18,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:18,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:18,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-15 23:43:19,013 INFO L375 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 16 treesize of output 8 [2019-11-15 23:43:19,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:19,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:19,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:19,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-15 23:43:19,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:19,024 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:19,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2019-11-15 23:43:19,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683779483] [2019-11-15 23:43:19,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:43:19,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:43:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:43:19,027 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 14 states. [2019-11-15 23:43:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:19,511 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-15 23:43:19,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:43:19,511 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-15 23:43:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:19,512 INFO L225 Difference]: With dead ends: 45 [2019-11-15 23:43:19,512 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 23:43:19,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:43:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 23:43:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-11-15 23:43:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 23:43:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-15 23:43:19,519 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-11-15 23:43:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:19,519 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-15 23:43:19,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:43:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-15 23:43:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:43:19,520 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:19,520 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:19,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:19,725 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash -691139815, now seen corresponding path program 1 times [2019-11-15 23:43:19,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:19,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451642829] [2019-11-15 23:43:19,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:19,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:19,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:20,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451642829] [2019-11-15 23:43:20,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035933011] [2019-11-15 23:43:20,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:20,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-15 23:43:20,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:20,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-15 23:43:20,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2019-11-15 23:43:20,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,360 INFO L375 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-15 23:43:20,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,382 INFO L567 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-11-15 23:43:20,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:25 [2019-11-15 23:43:20,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:20,427 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_35|], 10=[|v_#memory_int_33|]} [2019-11-15 23:43:20,438 INFO L375 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 56 treesize of output 52 [2019-11-15 23:43:20,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,455 INFO L375 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 63 treesize of output 59 [2019-11-15 23:43:20,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,510 INFO L375 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 59 treesize of output 55 [2019-11-15 23:43:20,511 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,519 INFO L375 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 52 treesize of output 48 [2019-11-15 23:43:20,519 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,577 INFO L375 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 48 treesize of output 29 [2019-11-15 23:43:20,577 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2019-11-15 23:43:20,587 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 23:43:20,619 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:49 [2019-11-15 23:43:20,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:20,914 INFO L375 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 40 treesize of output 32 [2019-11-15 23:43:20,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,947 INFO L375 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 29 treesize of output 21 [2019-11-15 23:43:20,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,991 INFO L375 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 44 treesize of output 36 [2019-11-15 23:43:20,992 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:21,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:21,024 INFO L375 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 25 [2019-11-15 23:43:21,024 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:21,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:21,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 23:43:21,047 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:85, output treesize:38 [2019-11-15 23:43:21,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:21,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:43:21,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2019-11-15 23:43:21,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:21,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:21,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 16 [2019-11-15 23:43:21,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:21,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:21,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:21,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:5 [2019-11-15 23:43:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:21,174 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:21,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-11-15 23:43:21,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298347869] [2019-11-15 23:43:21,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 23:43:21,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 23:43:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:43:21,175 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 23 states. [2019-11-15 23:43:22,058 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-11-15 23:43:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:22,290 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-15 23:43:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:43:22,291 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-11-15 23:43:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:22,292 INFO L225 Difference]: With dead ends: 33 [2019-11-15 23:43:22,292 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 23:43:22,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:43:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 23:43:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-15 23:43:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:43:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-15 23:43:22,297 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-11-15 23:43:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:22,298 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-15 23:43:22,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 23:43:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-15 23:43:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:43:22,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:22,299 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:22,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:22,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1263868996, now seen corresponding path program 2 times [2019-11-15 23:43:22,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:22,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471661213] [2019-11-15 23:43:22,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:22,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:22,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:22,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471661213] [2019-11-15 23:43:22,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997286158] [2019-11-15 23:43:22,816 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:22,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:43:22,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:22,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 23:43:22,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:22,980 INFO L375 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-15 23:43:22,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:22,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:22,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:22,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:43:23,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:43:23,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 23:43:23,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:43:23,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,074 INFO L375 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 24 treesize of output 12 [2019-11-15 23:43:23,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-11-15 23:43:23,086 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_36|], 2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.base_40|]} [2019-11-15 23:43:23,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:43:23,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,115 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-15 23:43:23,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:23,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-11-15 23:43:23,134 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,148 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2019-11-15 23:43:23,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:43:23,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:23,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2019-11-15 23:43:23,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:43:23,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:23,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:23,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:23,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:4 [2019-11-15 23:43:23,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:23,311 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:23,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2019-11-15 23:43:23,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116579795] [2019-11-15 23:43:23,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 23:43:23,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:23,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 23:43:23,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:43:23,313 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 21 states. [2019-11-15 23:43:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:24,308 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-15 23:43:24,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:43:24,309 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-11-15 23:43:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:24,309 INFO L225 Difference]: With dead ends: 51 [2019-11-15 23:43:24,309 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 23:43:24,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=322, Invalid=938, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 23:43:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 23:43:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-11-15 23:43:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:43:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-15 23:43:24,315 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2019-11-15 23:43:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:24,316 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-15 23:43:24,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 23:43:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-15 23:43:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:43:24,317 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:24,317 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:24,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:24,525 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1321127298, now seen corresponding path program 2 times [2019-11-15 23:43:24,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:24,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529686739] [2019-11-15 23:43:24,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:24,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:24,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:25,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529686739] [2019-11-15 23:43:25,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426702880] [2019-11-15 23:43:25,091 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:25,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:43:25,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:25,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-15 23:43:25,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:25,248 INFO L375 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-15 23:43:25,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:43:25,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:25,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-15 23:43:25,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2019-11-15 23:43:25,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 23:43:25,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,386 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.6 percent of original size [2019-11-15 23:43:25,390 INFO L375 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 19 treesize of output 18 [2019-11-15 23:43:25,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,401 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2019-11-15 23:43:25,443 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_41|], 10=[|v_#memory_int_36|]} [2019-11-15 23:43:25,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:43:25,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:43:25,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:25,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-11-15 23:43:25,501 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,522 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:77, output treesize:52 [2019-11-15 23:43:25,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-15 23:43:25,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-15 23:43:25,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:43:25,669 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,688 INFO L375 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 49 treesize of output 25 [2019-11-15 23:43:25,689 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,702 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:60 [2019-11-15 23:43:25,749 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_44|], 10=[|v_#memory_int_38|]} [2019-11-15 23:43:25,755 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-15 23:43:25,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,792 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-15 23:43:25,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:25,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-15 23:43:25,819 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:25,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-15 23:43:25,847 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,889 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-11-15 23:43:25,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:25,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-11-15 23:43:25,896 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:25,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:25,911 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:124, output treesize:77 [2019-11-15 23:43:26,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:43:26,204 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-15 23:43:26,205 INFO L375 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 53 [2019-11-15 23:43:26,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:26,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:26,207 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-15 23:43:26,246 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.5 percent of original size [2019-11-15 23:43:26,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:26,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-11-15 23:43:26,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:26,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:26,268 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-15 23:43:26,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:26 [2019-11-15 23:43:26,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:26,341 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:26,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2019-11-15 23:43:26,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780938818] [2019-11-15 23:43:26,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 23:43:26,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:26,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 23:43:26,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2019-11-15 23:43:26,343 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 31 states. [2019-11-15 23:43:27,253 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-11-15 23:43:27,461 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 109 [2019-11-15 23:43:27,620 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-11-15 23:43:27,793 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 111 [2019-11-15 23:43:27,940 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-11-15 23:43:28,114 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-15 23:43:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:28,198 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-11-15 23:43:28,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:43:28,198 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-11-15 23:43:28,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:28,199 INFO L225 Difference]: With dead ends: 36 [2019-11-15 23:43:28,199 INFO L226 Difference]: Without dead ends: 31 [2019-11-15 23:43:28,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=288, Invalid=1692, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 23:43:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-15 23:43:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-15 23:43:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 23:43:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-15 23:43:28,206 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-11-15 23:43:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:28,207 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-15 23:43:28,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 23:43:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-15 23:43:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:43:28,208 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:28,208 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:28,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:28,422 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:28,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash -213891529, now seen corresponding path program 3 times [2019-11-15 23:43:28,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:28,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047437230] [2019-11-15 23:43:28,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:28,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:28,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:29,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047437230] [2019-11-15 23:43:29,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504188935] [2019-11-15 23:43:29,034 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:29,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 23:43:29,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:43:29,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-15 23:43:29,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:29,728 INFO L375 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-15 23:43:29,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:29,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-11-15 23:43:29,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:43:29,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:29,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 23:43:29,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:29,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 23:43:29,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,854 INFO L567 ElimStorePlain]: treesize reduction 14, result has 75.9 percent of original size [2019-11-15 23:43:29,858 INFO L375 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 24 treesize of output 12 [2019-11-15 23:43:29,858 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:29,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,867 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:29 [2019-11-15 23:43:29,900 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_41|], 2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.base_49|]} [2019-11-15 23:43:29,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:43:29,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:29,924 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-15 23:43:29,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:29,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:29,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-11-15 23:43:29,944 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:29,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:29,958 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:53 [2019-11-15 23:43:30,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-15 23:43:30,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,060 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_$Pointer$.base_50|]} [2019-11-15 23:43:30,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:43:30,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:43:30,091 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2019-11-15 23:43:30,092 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,124 INFO L567 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-11-15 23:43:30,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,125 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:54 [2019-11-15 23:43:30,197 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.offset_42|], 5=[|v_#memory_$Pointer$.base_51|]} [2019-11-15 23:43:30,200 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-15 23:43:30,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-15 23:43:30,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 23:43:30,286 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:30,325 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:43:30,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 70 [2019-11-15 23:43:30,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:30,342 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,389 INFO L567 ElimStorePlain]: treesize reduction 75, result has 47.6 percent of original size [2019-11-15 23:43:30,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,390 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:88 [2019-11-15 23:43:30,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:30,569 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 36 [2019-11-15 23:43:30,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:30,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:105, output treesize:67 [2019-11-15 23:43:30,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,648 INFO L375 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 50 [2019-11-15 23:43:30,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:30,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:30,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:30,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:30,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:30,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:30,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:30,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:30,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:4 [2019-11-15 23:43:30,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:43:30,660 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:30,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2019-11-15 23:43:30,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208412357] [2019-11-15 23:43:30,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 23:43:30,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:43:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 23:43:30,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2019-11-15 23:43:30,661 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 30 states. [2019-11-15 23:43:31,446 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-15 23:43:31,616 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-11-15 23:43:31,892 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-11-15 23:43:32,142 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-11-15 23:43:32,353 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-11-15 23:43:32,528 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2019-11-15 23:43:32,691 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-11-15 23:43:32,862 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-11-15 23:43:33,105 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-11-15 23:43:33,272 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-11-15 23:43:33,434 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-11-15 23:43:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:33,480 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-15 23:43:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:43:33,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-11-15 23:43:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:33,482 INFO L225 Difference]: With dead ends: 57 [2019-11-15 23:43:33,482 INFO L226 Difference]: Without dead ends: 49 [2019-11-15 23:43:33,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=541, Invalid=1909, Unknown=0, NotChecked=0, Total=2450 [2019-11-15 23:43:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-15 23:43:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-15 23:43:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:43:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-15 23:43:33,489 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2019-11-15 23:43:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:33,490 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-15 23:43:33,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 23:43:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-15 23:43:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:43:33,490 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:33,491 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:43:33,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:43:33,693 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:33,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash -271149831, now seen corresponding path program 3 times [2019-11-15 23:43:33,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:43:33,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61197666] [2019-11-15 23:43:33,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:33,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:43:33,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:43:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:43:33,808 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:43:33,808 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:43:33,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:43:33 BoogieIcfgContainer [2019-11-15 23:43:33,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:43:33,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:43:33,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:43:33,882 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:43:33,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:43:17" (3/4) ... [2019-11-15 23:43:33,884 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:43:33,941 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_84844c39-d04a-42b2-a9e5-148841d94a5c/bin/uautomizer/witness.graphml [2019-11-15 23:43:33,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:43:33,943 INFO L168 Benchmark]: Toolchain (without parser) took 17632.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.0 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -299.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:43:33,943 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:43:33,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:33,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.32 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-15 23:43:33,944 INFO L168 Benchmark]: Boogie Preprocessor took 36.97 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-15 23:43:33,945 INFO L168 Benchmark]: RCFGBuilder took 460.84 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:33,946 INFO L168 Benchmark]: TraceAbstraction took 16532.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -180.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:43:33,946 INFO L168 Benchmark]: Witness Printer took 60.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:33,949 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.32 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 36.97 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 460.84 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16532.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -180.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 60.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L522] mlist *head; VAL [head={0:0}] [L543] int i; [L544] mlist *mylist, *temp; [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={0:0}] [L533] COND TRUE head==((void *)0) [L534] l->next = ((void *)0) VAL [head={0:0}] [L539] head = l [L540] return 0; VAL [head={-2:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-2:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-2:0}] [L539] head = l [L540] return 0; VAL [head={1:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={1:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={1:0}] [L539] head = l [L540] return 0; VAL [head={-1:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-1:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-1:0}] [L539] head = l [L540] return 0; VAL [head={2:0}] [L524] l = head VAL [head={2:0}] [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={2:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={2:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={2:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={2:0}] [L525] COND FALSE !(l!=((void *)0) && l->key!=k) [L528] return l; VAL [head={2:0}] [L549] temp = search_list(head,2) [L550] temp->key [L3] COND TRUE !(cond) VAL [head={2:0}] [L4] __VERIFIER_error() VAL [head={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Result: UNSAFE, OverallTime: 16.4s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 79 SDtfs, 867 SDslu, 313 SDs, 0 SdLazy, 1655 SolverSat, 553 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 113 SyntacticMatches, 12 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 312 ConstructedInterpolants, 14 QuantifiedInterpolants, 123200 SizeOfPredicates, 108 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 12/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...