./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/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-678e011 [2019-11-20 02:24:52,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:24:52,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:24:52,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:24:52,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:24:52,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:24:52,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:24:52,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:24:52,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:24:52,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:24:52,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:24:52,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:24:52,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:24:52,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:24:52,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:24:52,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:24:52,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:24:52,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:24:52,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:24:52,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:24:52,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:24:52,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:24:52,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:24:52,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:24:52,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:24:52,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:24:52,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:24:52,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:24:52,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:24:52,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:24:52,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:24:52,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:24:52,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:24:52,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:24:52,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:24:52,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:24:52,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:24:52,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:24:52,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:24:52,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:24:52,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:24:52,323 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:24:52,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:24:52,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:24:52,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:24:52,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:24:52,340 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:24:52,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:24:52,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:24:52,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:24:52,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:24:52,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:24:52,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:24:52,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:24:52,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:24:52,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:24:52,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:24:52,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:24:52,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:24:52,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:24:52,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:24:52,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:24:52,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:24:52,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:24:52,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:24:52,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:24:52,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:24:52,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:24:52,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:24:52,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:24:52,344 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_1ae6b429-e378-4e8a-8047-1ce79342db23/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-20 02:24:52,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:24:52,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:24:52,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:24:52,496 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:24:52,496 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:24:52,497 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/../../sv-benchmarks/c/list-properties/list_search-1.i [2019-11-20 02:24:52,552 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/data/a68431542/901d321c2a60447e8c5268ecab4fd746/FLAGf2e2cd661 [2019-11-20 02:24:53,010 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:24:53,010 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/sv-benchmarks/c/list-properties/list_search-1.i [2019-11-20 02:24:53,022 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/data/a68431542/901d321c2a60447e8c5268ecab4fd746/FLAGf2e2cd661 [2019-11-20 02:24:53,035 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/data/a68431542/901d321c2a60447e8c5268ecab4fd746 [2019-11-20 02:24:53,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:24:53,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:24:53,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:24:53,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:24:53,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:24:53,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a535999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53, skipping insertion in model container [2019-11-20 02:24:53,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,053 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:24:53,085 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:24:53,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:24:53,495 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:24:53,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:24:53,598 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:24:53,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53 WrapperNode [2019-11-20 02:24:53,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:24:53,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:24:53,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:24:53,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:24:53,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:24:53,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:24:53,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:24:53,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:24:53,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... [2019-11-20 02:24:53,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:24:53,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:24:53,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:24:53,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:24:53,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/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-20 02:24:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 02:24:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 02:24:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 02:24:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 02:24:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 02:24:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:24:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:24:53,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:24:54,147 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:24:54,147 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-20 02:24:54,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:24:54 BoogieIcfgContainer [2019-11-20 02:24:54,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:24:54,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:24:54,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:24:54,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:24:54,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:24:53" (1/3) ... [2019-11-20 02:24:54,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a66b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:24:54, skipping insertion in model container [2019-11-20 02:24:54,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:53" (2/3) ... [2019-11-20 02:24:54,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a66b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:24:54, skipping insertion in model container [2019-11-20 02:24:54,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:24:54" (3/3) ... [2019-11-20 02:24:54,154 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2019-11-20 02:24:54,162 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:24:54,168 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:24:54,178 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:24:54,198 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:24:54,198 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:24:54,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:24:54,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:24:54,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:24:54,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:24:54,199 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:24:54,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:24:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-20 02:24:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:24:54,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:24:54,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:24:54,218 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:24:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:54,224 INFO L82 PathProgramCache]: Analyzing trace with hash -332178203, now seen corresponding path program 1 times [2019-11-20 02:24:54,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:54,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508968757] [2019-11-20 02:24:54,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:54,457 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-20 02:24:54,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508968757] [2019-11-20 02:24:54,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:24:54,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:24:54,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005084892] [2019-11-20 02:24:54,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:24:54,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:24:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:24:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:24:54,476 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2019-11-20 02:24:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:24:54,583 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2019-11-20 02:24:54,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:24:54,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-20 02:24:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:24:54,591 INFO L225 Difference]: With dead ends: 49 [2019-11-20 02:24:54,591 INFO L226 Difference]: Without dead ends: 22 [2019-11-20 02:24:54,594 INFO L630 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-20 02:24:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-20 02:24:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-20 02:24:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 02:24:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-20 02:24:54,621 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-11-20 02:24:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:24:54,621 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-20 02:24:54,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:24:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-20 02:24:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 02:24:54,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:24:54,623 INFO L410 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-20 02:24:54,623 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:24:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1321983588, now seen corresponding path program 1 times [2019-11-20 02:24:54,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:54,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060818775] [2019-11-20 02:24:54,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:54,754 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-20 02:24:54,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060818775] [2019-11-20 02:24:54,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:24:54,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:24:54,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319324084] [2019-11-20 02:24:54,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:24:54,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:24:54,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:24:54,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:24:54,757 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-11-20 02:24:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:24:54,912 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-20 02:24:54,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:24:54,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-20 02:24:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:24:54,913 INFO L225 Difference]: With dead ends: 38 [2019-11-20 02:24:54,914 INFO L226 Difference]: Without dead ends: 30 [2019-11-20 02:24:54,914 INFO L630 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-20 02:24:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-20 02:24:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-20 02:24:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 02:24:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-20 02:24:54,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-11-20 02:24:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:24:54,920 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-20 02:24:54,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:24:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-20 02:24:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 02:24:54,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:24:54,923 INFO L410 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-20 02:24:54,923 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:24:54,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:54,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1379241890, now seen corresponding path program 1 times [2019-11-20 02:24:54,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:54,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070459366] [2019-11-20 02:24:54,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:55,080 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-20 02:24:55,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070459366] [2019-11-20 02:24:55,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:24:55,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:24:55,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733946466] [2019-11-20 02:24:55,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:24:55,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:24:55,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:24:55,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:24:55,082 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-11-20 02:24:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:24:55,279 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-20 02:24:55,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:24:55,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-20 02:24:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:24:55,281 INFO L225 Difference]: With dead ends: 30 [2019-11-20 02:24:55,281 INFO L226 Difference]: Without dead ends: 25 [2019-11-20 02:24:55,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:24:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-20 02:24:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-20 02:24:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 02:24:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-11-20 02:24:55,287 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2019-11-20 02:24:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:24:55,287 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-20 02:24:55,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:24:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-11-20 02:24:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 02:24:55,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:24:55,289 INFO L410 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-20 02:24:55,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:24:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash -633881513, now seen corresponding path program 1 times [2019-11-20 02:24:55,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:55,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830923394] [2019-11-20 02:24:55,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:55,581 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-20 02:24:55,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830923394] [2019-11-20 02:24:55,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580557426] [2019-11-20 02:24:55,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/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-20 02:24:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:55,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 02:24:55,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:55,795 INFO L377 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-20 02:24:55,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:55,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:55,809 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-20 02:24:55,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-20 02:24:55,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-20 02:24:55,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:55,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:55,863 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-20 02:24:55,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-20 02:24:55,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:55,872 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-20 02:24:55,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:24:55,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-11-20 02:24:55,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583354232] [2019-11-20 02:24:55,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 02:24:55,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:24:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 02:24:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-20 02:24:55,879 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 14 states. [2019-11-20 02:24:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:24:56,367 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-20 02:24:56,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 02:24:56,367 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-20 02:24:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:24:56,368 INFO L225 Difference]: With dead ends: 45 [2019-11-20 02:24:56,369 INFO L226 Difference]: Without dead ends: 37 [2019-11-20 02:24:56,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-11-20 02:24:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-20 02:24:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-11-20 02:24:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 02:24:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-20 02:24:56,375 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-11-20 02:24:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:24:56,376 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-20 02:24:56,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 02:24:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-20 02:24:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 02:24:56,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:24:56,377 INFO L410 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-20 02:24:56,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:24:56,582 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:24:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash -691139815, now seen corresponding path program 1 times [2019-11-20 02:24:56,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:56,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042437785] [2019-11-20 02:24:56,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:56,979 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-20 02:24:56,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042437785] [2019-11-20 02:24:56,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202796077] [2019-11-20 02:24:56,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/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-20 02:24:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:57,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-20 02:24:57,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:57,084 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 02:24:57,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 02:24:57,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:24:57,136 INFO L377 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-20 02:24:57,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2019-11-20 02:24:57,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,226 INFO L377 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-20 02:24:57,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 02:24:57,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,251 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-20 02:24:57,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:25 [2019-11-20 02:24:57,307 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_35|], 10=[|v_#memory_int_33|]} [2019-11-20 02:24:57,318 INFO L377 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-20 02:24:57,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,388 INFO L377 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-20 02:24:57,388 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:24:57,409 INFO L377 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-20 02:24:57,410 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,429 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-20 02:24:57,429 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:36 [2019-11-20 02:24:57,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 02:24:57,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 02:24:57,586 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:57,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:24:57,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:14 [2019-11-20 02:24:57,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:57,678 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-20 02:24:57,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:24:57,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-20 02:24:57,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085369435] [2019-11-20 02:24:57,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 02:24:57,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:24:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 02:24:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-20 02:24:57,680 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 22 states. [2019-11-20 02:24:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:24:58,202 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-20 02:24:58,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 02:24:58,203 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-11-20 02:24:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:24:58,204 INFO L225 Difference]: With dead ends: 33 [2019-11-20 02:24:58,204 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 02:24:58,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-11-20 02:24:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 02:24:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-20 02:24:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 02:24:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-20 02:24:58,213 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-11-20 02:24:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:24:58,214 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-20 02:24:58,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 02:24:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-20 02:24:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 02:24:58,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:24:58,217 INFO L410 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-20 02:24:58,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:24:58,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:24:58,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:58,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1263868996, now seen corresponding path program 2 times [2019-11-20 02:24:58,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:58,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85803222] [2019-11-20 02:24:58,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:58,772 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-20 02:24:58,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85803222] [2019-11-20 02:24:58,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992081490] [2019-11-20 02:24:58,773 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/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-20 02:24:58,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:24:58,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:24:58,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-20 02:24:58,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:58,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 02:24:58,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:58,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:58,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:24:58,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 02:24:58,993 INFO L377 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-20 02:24:58,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:59,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,001 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-20 02:24:59,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-20 02:24:59,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,020 INFO L377 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-20 02:24:59,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:59,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-20 02:24:59,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:59,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,049 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-20 02:24:59,049 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-11-20 02:24:59,055 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_36|], 2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.base_40|]} [2019-11-20 02:24:59,058 INFO L377 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-20 02:24:59,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:59,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,075 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-20 02:24:59,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:24:59,096 INFO L377 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-20 02:24:59,097 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:59,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,112 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-20 02:24:59,112 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2019-11-20 02:24:59,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 02:24:59,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:59,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,249 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-20 02:24:59,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2019-11-20 02:24:59,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,320 INFO L377 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-20 02:24:59,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:59,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:59,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:59,324 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-20 02:24:59,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:4 [2019-11-20 02:24:59,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:59,330 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-20 02:24:59,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:24:59,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2019-11-20 02:24:59,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13739225] [2019-11-20 02:24:59,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 02:24:59,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:24:59,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 02:24:59,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-20 02:24:59,332 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 18 states. [2019-11-20 02:25:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:25:00,069 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-20 02:25:00,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 02:25:00,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-11-20 02:25:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:25:00,074 INFO L225 Difference]: With dead ends: 51 [2019-11-20 02:25:00,075 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 02:25:00,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-11-20 02:25:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 02:25:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-11-20 02:25:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 02:25:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-20 02:25:00,081 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2019-11-20 02:25:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:25:00,082 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-20 02:25:00,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 02:25:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-20 02:25:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 02:25:00,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:25:00,083 INFO L410 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-20 02:25:00,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:25:00,287 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:25:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:25:00,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1321127298, now seen corresponding path program 2 times [2019-11-20 02:25:00,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:25:00,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066482181] [2019-11-20 02:25:00,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:25:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:25:01,007 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-20 02:25:01,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066482181] [2019-11-20 02:25:01,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279225928] [2019-11-20 02:25:01,008 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/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-20 02:25:01,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:25:01,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:25:01,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-20 02:25:01,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:25:01,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 02:25:01,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 02:25:01,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:01,238 INFO L377 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-20 02:25:01,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,249 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-20 02:25:01,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2019-11-20 02:25:01,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,349 INFO L377 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-20 02:25:01,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,377 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.6 percent of original size [2019-11-20 02:25:01,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 02:25:01,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,392 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-20 02:25:01,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2019-11-20 02:25:01,431 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_41|], 10=[|v_#memory_int_36|]} [2019-11-20 02:25:01,435 INFO L377 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-20 02:25:01,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,467 INFO L377 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-20 02:25:01,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:01,496 INFO L377 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-20 02:25:01,497 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,512 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-20 02:25:01,512 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:77, output treesize:52 [2019-11-20 02:25:01,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,603 INFO L377 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-20 02:25:01,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,642 INFO L377 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-20 02:25:01,643 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,676 INFO L377 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-20 02:25:01,676 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2019-11-20 02:25:01,702 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,725 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-20 02:25:01,725 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:60 [2019-11-20 02:25:01,774 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-20 02:25:01,778 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-20 02:25:01,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,824 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-20 02:25:01,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:01,859 INFO L377 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-20 02:25:01,859 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:01,900 INFO L377 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-20 02:25:01,900 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,945 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-11-20 02:25:01,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:01,951 INFO L377 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-20 02:25:01,951 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:01,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:01,976 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-20 02:25:01,976 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:124, output treesize:77 [2019-11-20 02:25:02,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 02:25:02,201 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-20 02:25:02,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 53 [2019-11-20 02:25:02,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:02,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:02,203 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-20 02:25:02,230 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-20 02:25:02,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:02,236 INFO L377 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-20 02:25:02,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:02,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:02,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:25:02,246 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:14 [2019-11-20 02:25:02,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:02,276 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|], 2=[v_prenex_1]} [2019-11-20 02:25:02,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-20 02:25:02,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:02,290 INFO L567 ElimStorePlain]: treesize reduction 21, result has 19.2 percent of original size [2019-11-20 02:25:02,290 INFO L464 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2019-11-20 02:25:02,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:25:02,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2019-11-20 02:25:02,319 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-20 02:25:02,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:25:02,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-11-20 02:25:02,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937680046] [2019-11-20 02:25:02,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-20 02:25:02,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:25:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-20 02:25:02,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-11-20 02:25:02,322 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-11-20 02:25:03,221 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2019-11-20 02:25:03,426 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2019-11-20 02:25:03,634 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 107 [2019-11-20 02:25:03,826 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2019-11-20 02:25:04,127 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-11-20 02:25:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:25:04,167 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-11-20 02:25:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 02:25:04,167 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 27 [2019-11-20 02:25:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:25:04,168 INFO L225 Difference]: With dead ends: 36 [2019-11-20 02:25:04,168 INFO L226 Difference]: Without dead ends: 31 [2019-11-20 02:25:04,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 02:25:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-20 02:25:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-20 02:25:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 02:25:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-20 02:25:04,175 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-11-20 02:25:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:25:04,175 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-20 02:25:04,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-20 02:25:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-20 02:25:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 02:25:04,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:25:04,176 INFO L410 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-20 02:25:04,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:25:04,377 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:25:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:25:04,377 INFO L82 PathProgramCache]: Analyzing trace with hash -213891529, now seen corresponding path program 3 times [2019-11-20 02:25:04,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:25:04,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829460441] [2019-11-20 02:25:04,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:25:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:25:04,917 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-20 02:25:04,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829460441] [2019-11-20 02:25:04,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833337515] [2019-11-20 02:25:04,918 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/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-20 02:25:05,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 02:25:05,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:25:05,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-20 02:25:05,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:25:05,535 INFO L377 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-20 02:25:05,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,541 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-20 02:25:05,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-20 02:25:05,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:05,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-20 02:25:05,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-20 02:25:05,628 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_41|], 2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.base_49|]} [2019-11-20 02:25:05,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:25:05,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,644 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-20 02:25:05,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:05,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 02:25:05,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,667 INFO L377 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 1 case distinctions, treesize of input 25 treesize of output 44 [2019-11-20 02:25:05,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:05,668 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,696 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-20 02:25:05,696 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-20 02:25:05,696 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2019-11-20 02:25:05,758 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_$Pointer$.base_50|]} [2019-11-20 02:25:05,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:05,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 02:25:05,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:05,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 02:25:05,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2019-11-20 02:25:05,802 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,819 INFO L567 ElimStorePlain]: treesize reduction 30, result has 57.1 percent of original size [2019-11-20 02:25:05,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:40 [2019-11-20 02:25:05,881 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-20 02:25:05,883 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-20 02:25:05,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,907 INFO L377 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 23 treesize of output 11 [2019-11-20 02:25:05,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 02:25:05,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-20 02:25:05,937 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:05,966 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-11-20 02:25:05,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:25:05,972 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 02:25:05,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:05,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 82 [2019-11-20 02:25:05,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:05,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:05,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:05,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:05,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:05,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:05,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:05,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,010 INFO L496 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 02:25:06,118 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-11-20 02:25:06,119 INFO L567 ElimStorePlain]: treesize reduction 121, result has 52.4 percent of original size [2019-11-20 02:25:06,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 02:25:06,121 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:91, output treesize:194 [2019-11-20 02:25:06,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,447 INFO L343 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2019-11-20 02:25:06,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 48 [2019-11-20 02:25:06,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:06,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:06,457 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-20 02:25:06,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:51 [2019-11-20 02:25:06,509 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:06,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 02:25:06,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:25:06,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:25:06,518 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-20 02:25:06,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:4 [2019-11-20 02:25:06,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:06,527 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-20 02:25:06,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:25:06,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-11-20 02:25:06,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955097774] [2019-11-20 02:25:06,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 02:25:06,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:25:06,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 02:25:06,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-11-20 02:25:06,530 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 32 states. [2019-11-20 02:25:07,673 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-11-20 02:25:07,849 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-11-20 02:25:08,361 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-11-20 02:25:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:25:08,612 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-20 02:25:08,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 02:25:08,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-11-20 02:25:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:25:08,622 INFO L225 Difference]: With dead ends: 57 [2019-11-20 02:25:08,623 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 02:25:08,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=757, Invalid=2435, Unknown=0, NotChecked=0, Total=3192 [2019-11-20 02:25:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 02:25:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-20 02:25:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 02:25:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-20 02:25:08,636 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2019-11-20 02:25:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:25:08,636 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-20 02:25:08,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 02:25:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-20 02:25:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 02:25:08,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:25:08,638 INFO L410 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-20 02:25:08,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:25:08,839 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:25:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:25:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash -271149831, now seen corresponding path program 3 times [2019-11-20 02:25:08,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:25:08,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474760344] [2019-11-20 02:25:08,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:25:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:25:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:25:08,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:25:08,952 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 02:25:09,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:25:09 BoogieIcfgContainer [2019-11-20 02:25:09,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:25:09,008 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:25:09,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:25:09,008 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:25:09,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:24:54" (3/4) ... [2019-11-20 02:25:09,011 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 02:25:09,072 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1ae6b429-e378-4e8a-8047-1ce79342db23/bin/uautomizer/witness.graphml [2019-11-20 02:25:09,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:25:09,074 INFO L168 Benchmark]: Toolchain (without parser) took 16035.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 393.2 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -75.9 MB). Peak memory consumption was 317.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:25:09,074 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:25:09,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -213.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:25:09,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:25:09,075 INFO L168 Benchmark]: Boogie Preprocessor took 34.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:25:09,076 INFO L168 Benchmark]: RCFGBuilder took 468.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:25:09,076 INFO L168 Benchmark]: TraceAbstraction took 14858.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.1 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:25:09,076 INFO L168 Benchmark]: Witness Printer took 64.97 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:25:09,078 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 559.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -213.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 468.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14858.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.1 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. * Witness Printer took 64.97 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 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={-4:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-4:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-4:0}] [L539] head = l [L540] return 0; VAL [head={-3:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-3:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-3: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}] [L524] l = head VAL [head={-1:0}] [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1: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={-1: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={-1: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={-1:0}] [L525] COND FALSE !(l!=((void *)0) && l->key!=k) [L528] return l; VAL [head={-1:0}] [L549] temp = search_list(head,2) [L550] temp->key [L3] COND TRUE !(cond) VAL [head={-1:0}] [L4] __VERIFIER_error() VAL [head={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 916 SDslu, 295 SDs, 0 SdLazy, 1533 SolverSat, 566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 115 SyntacticMatches, 11 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 7.3s 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.7s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 312 ConstructedInterpolants, 12 QuantifiedInterpolants, 112892 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1061 ConjunctsInSsa, 268 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...