./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-6b5699a [2019-11-25 08:48:11,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:48:11,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:48:11,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:48:11,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:48:11,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:48:11,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:48:11,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:48:11,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:48:11,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:48:11,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:48:11,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:48:11,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:48:11,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:48:11,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:48:11,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:48:11,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:48:11,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:48:11,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:48:11,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:48:11,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:48:11,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:48:11,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:48:11,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:48:11,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:48:11,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:48:11,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:48:11,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:48:11,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:48:11,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:48:11,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:48:11,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:48:11,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:48:11,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:48:11,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:48:11,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:48:11,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:48:11,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:48:11,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:48:11,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:48:11,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:48:11,670 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:48:11,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:48:11,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:48:11,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:48:11,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:48:11,684 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:48:11,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:48:11,685 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:48:11,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:48:11,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:48:11,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:48:11,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:48:11,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:48:11,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:48:11,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:48:11,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:48:11,686 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:48:11,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:48:11,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:48:11,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:48:11,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:48:11,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:48:11,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:48:11,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:48:11,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:48:11,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:48:11,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:48:11,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:48:11,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:48:11,689 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_5efe1f5f-0f94-4545-938c-7290bfa31b2d/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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2019-11-25 08:48:11,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:48:11,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:48:11,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:48:11,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:48:11,872 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:48:11,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-25 08:48:11,932 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/data/267e00c65/ff3dec336b57492f93e396537bf98ffe/FLAG2e72ea14b [2019-11-25 08:48:12,354 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:48:12,355 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-25 08:48:12,372 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/data/267e00c65/ff3dec336b57492f93e396537bf98ffe/FLAG2e72ea14b [2019-11-25 08:48:12,739 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/data/267e00c65/ff3dec336b57492f93e396537bf98ffe [2019-11-25 08:48:12,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:48:12,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:48:12,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:12,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:48:12,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:48:12,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:12" (1/1) ... [2019-11-25 08:48:12,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec5dd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:12, skipping insertion in model container [2019-11-25 08:48:12,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:12" (1/1) ... [2019-11-25 08:48:12,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:48:12,816 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:48:13,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:13,191 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:48:13,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:13,305 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:48:13,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13 WrapperNode [2019-11-25 08:48:13,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:13,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:13,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:48:13,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:48:13,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... [2019-11-25 08:48:13,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... [2019-11-25 08:48:13,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:13,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:48:13,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:48:13,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:48:13,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... [2019-11-25 08:48:13,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... [2019-11-25 08:48:13,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... [2019-11-25 08:48:13,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... [2019-11-25 08:48:13,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... [2019-11-25 08:48:13,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... [2019-11-25 08:48:13,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... [2019-11-25 08:48:13,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:48:13,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:48:13,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:48:13,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:48:13,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/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-25 08:48:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:48:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:48:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:48:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:48:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:48:13,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:48:13,979 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:48:13,980 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-25 08:48:13,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:13 BoogieIcfgContainer [2019-11-25 08:48:13,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:48:13,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:48:13,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:48:13,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:48:13,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:48:12" (1/3) ... [2019-11-25 08:48:13,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2123e0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:13, skipping insertion in model container [2019-11-25 08:48:13,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:13" (2/3) ... [2019-11-25 08:48:13,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2123e0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:13, skipping insertion in model container [2019-11-25 08:48:13,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:13" (3/3) ... [2019-11-25 08:48:13,992 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2019-11-25 08:48:14,000 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:48:14,016 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-25 08:48:14,026 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-25 08:48:14,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:48:14,051 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:48:14,051 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:48:14,051 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:48:14,051 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:48:14,051 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:48:14,051 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:48:14,051 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:48:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-25 08:48:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-25 08:48:14,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:14,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-25 08:48:14,072 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-11-25 08:48:14,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:14,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756129070] [2019-11-25 08:48:14,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:14,217 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-25 08:48:14,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756129070] [2019-11-25 08:48:14,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:14,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:14,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253853963] [2019-11-25 08:48:14,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:14,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:14,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:14,233 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-11-25 08:48:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:14,301 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2019-11-25 08:48:14,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:14,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-25 08:48:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:14,310 INFO L225 Difference]: With dead ends: 182 [2019-11-25 08:48:14,310 INFO L226 Difference]: Without dead ends: 96 [2019-11-25 08:48:14,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-25 08:48:14,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-11-25 08:48:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-25 08:48:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-11-25 08:48:14,350 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2019-11-25 08:48:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:14,350 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-11-25 08:48:14,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-11-25 08:48:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:48:14,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:14,351 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:14,352 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-11-25 08:48:14,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:14,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717951012] [2019-11-25 08:48:14,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:14,410 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-25 08:48:14,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717951012] [2019-11-25 08:48:14,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:14,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:14,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755806957] [2019-11-25 08:48:14,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:14,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:14,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:14,413 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 3 states. [2019-11-25 08:48:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:14,428 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-11-25 08:48:14,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:14,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 08:48:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:14,430 INFO L225 Difference]: With dead ends: 81 [2019-11-25 08:48:14,430 INFO L226 Difference]: Without dead ends: 79 [2019-11-25 08:48:14,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-25 08:48:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-25 08:48:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-25 08:48:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-25 08:48:14,440 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2019-11-25 08:48:14,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:14,441 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-25 08:48:14,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-25 08:48:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:48:14,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:14,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:14,442 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:14,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:14,442 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-11-25 08:48:14,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:14,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681386589] [2019-11-25 08:48:14,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:14,513 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-25 08:48:14,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681386589] [2019-11-25 08:48:14,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:14,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:14,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461956430] [2019-11-25 08:48:14,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:14,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:14,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:14,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:14,515 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2019-11-25 08:48:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:14,605 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-11-25 08:48:14,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:14,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 08:48:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:14,607 INFO L225 Difference]: With dead ends: 80 [2019-11-25 08:48:14,607 INFO L226 Difference]: Without dead ends: 78 [2019-11-25 08:48:14,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-25 08:48:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-25 08:48:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-25 08:48:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-25 08:48:14,615 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2019-11-25 08:48:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:14,616 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-25 08:48:14,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-25 08:48:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:48:14,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:14,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:14,617 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:14,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-11-25 08:48:14,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:14,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986933144] [2019-11-25 08:48:14,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:14,676 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-25 08:48:14,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986933144] [2019-11-25 08:48:14,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:14,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:14,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608549540] [2019-11-25 08:48:14,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:14,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:14,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:14,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:14,678 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 3 states. [2019-11-25 08:48:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:14,731 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2019-11-25 08:48:14,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:14,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-25 08:48:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:14,736 INFO L225 Difference]: With dead ends: 79 [2019-11-25 08:48:14,736 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 08:48:14,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 08:48:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-11-25 08:48:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 08:48:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-11-25 08:48:14,743 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2019-11-25 08:48:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:14,744 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-11-25 08:48:14,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-11-25 08:48:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:48:14,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:14,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:14,745 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2019-11-25 08:48:14,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:14,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571479884] [2019-11-25 08:48:14,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:14,827 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-25 08:48:14,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571479884] [2019-11-25 08:48:14,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:14,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:14,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657629581] [2019-11-25 08:48:14,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:14,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:14,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:14,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:14,829 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-11-25 08:48:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:14,940 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2019-11-25 08:48:14,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:14,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-25 08:48:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:14,942 INFO L225 Difference]: With dead ends: 190 [2019-11-25 08:48:14,942 INFO L226 Difference]: Without dead ends: 126 [2019-11-25 08:48:14,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-25 08:48:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2019-11-25 08:48:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:48:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-11-25 08:48:14,951 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2019-11-25 08:48:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:14,951 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-11-25 08:48:14,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-11-25 08:48:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:48:14,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:14,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:14,953 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:14,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-11-25 08:48:14,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:14,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36953906] [2019-11-25 08:48:14,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:15,009 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-25 08:48:15,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36953906] [2019-11-25 08:48:15,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:15,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:15,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229932434] [2019-11-25 08:48:15,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:48:15,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:15,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:48:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:15,011 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 5 states. [2019-11-25 08:48:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:15,105 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2019-11-25 08:48:15,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:15,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-25 08:48:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:15,106 INFO L225 Difference]: With dead ends: 134 [2019-11-25 08:48:15,107 INFO L226 Difference]: Without dead ends: 114 [2019-11-25 08:48:15,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:48:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-25 08:48:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2019-11-25 08:48:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 08:48:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-11-25 08:48:15,114 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2019-11-25 08:48:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:15,114 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-11-25 08:48:15,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:48:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-11-25 08:48:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 08:48:15,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:15,116 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] [2019-11-25 08:48:15,116 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:15,116 INFO L82 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2019-11-25 08:48:15,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:15,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576644975] [2019-11-25 08:48:15,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:15,150 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-25 08:48:15,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576644975] [2019-11-25 08:48:15,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:15,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:15,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036555102] [2019-11-25 08:48:15,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:15,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:15,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:15,153 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 3 states. [2019-11-25 08:48:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:15,171 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2019-11-25 08:48:15,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:15,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-25 08:48:15,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:15,172 INFO L225 Difference]: With dead ends: 139 [2019-11-25 08:48:15,173 INFO L226 Difference]: Without dead ends: 97 [2019-11-25 08:48:15,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-25 08:48:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2019-11-25 08:48:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-25 08:48:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-11-25 08:48:15,179 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2019-11-25 08:48:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:15,179 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-11-25 08:48:15,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-11-25 08:48:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:48:15,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:15,182 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-25 08:48:15,182 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-11-25 08:48:15,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:15,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740443508] [2019-11-25 08:48:15,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:15,217 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-25 08:48:15,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740443508] [2019-11-25 08:48:15,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:15,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:15,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022545644] [2019-11-25 08:48:15,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:15,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:15,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:15,219 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2019-11-25 08:48:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:15,234 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-11-25 08:48:15,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:15,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-25 08:48:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:15,235 INFO L225 Difference]: With dead ends: 76 [2019-11-25 08:48:15,236 INFO L226 Difference]: Without dead ends: 74 [2019-11-25 08:48:15,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-25 08:48:15,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-25 08:48:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:48:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-11-25 08:48:15,241 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2019-11-25 08:48:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:15,241 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-11-25 08:48:15,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-11-25 08:48:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:48:15,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:15,243 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, 1, 1] [2019-11-25 08:48:15,243 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:15,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:15,243 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-11-25 08:48:15,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:15,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451853656] [2019-11-25 08:48:15,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:15,322 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-25 08:48:15,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451853656] [2019-11-25 08:48:15,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:15,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:15,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523621363] [2019-11-25 08:48:15,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:15,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:15,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:15,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:15,324 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2019-11-25 08:48:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:15,403 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-25 08:48:15,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:15,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-25 08:48:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:15,405 INFO L225 Difference]: With dead ends: 75 [2019-11-25 08:48:15,405 INFO L226 Difference]: Without dead ends: 73 [2019-11-25 08:48:15,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-25 08:48:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-11-25 08:48:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 08:48:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-11-25 08:48:15,410 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2019-11-25 08:48:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:15,411 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-11-25 08:48:15,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-11-25 08:48:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:48:15,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:15,426 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, 1, 1, 1] [2019-11-25 08:48:15,427 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:15,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-11-25 08:48:15,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:15,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272531338] [2019-11-25 08:48:15,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:15,532 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-25 08:48:15,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272531338] [2019-11-25 08:48:15,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:15,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:48:15,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773343183] [2019-11-25 08:48:15,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:48:15,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:15,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:48:15,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:15,535 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 6 states. [2019-11-25 08:48:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:15,791 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2019-11-25 08:48:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:48:15,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-25 08:48:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:15,792 INFO L225 Difference]: With dead ends: 178 [2019-11-25 08:48:15,792 INFO L226 Difference]: Without dead ends: 135 [2019-11-25 08:48:15,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:48:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-25 08:48:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2019-11-25 08:48:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-25 08:48:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-25 08:48:15,800 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2019-11-25 08:48:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:15,800 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-25 08:48:15,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:48:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-25 08:48:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:48:15,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:15,802 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, 1, 1, 1] [2019-11-25 08:48:15,802 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:15,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-11-25 08:48:15,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:15,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011052560] [2019-11-25 08:48:15,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:16,107 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-25 08:48:16,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011052560] [2019-11-25 08:48:16,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:16,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:48:16,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280094175] [2019-11-25 08:48:16,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:48:16,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:16,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:48:16,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:48:16,109 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 8 states. [2019-11-25 08:48:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:16,801 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2019-11-25 08:48:16,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:48:16,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-25 08:48:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:16,803 INFO L225 Difference]: With dead ends: 190 [2019-11-25 08:48:16,803 INFO L226 Difference]: Without dead ends: 188 [2019-11-25 08:48:16,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:48:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-25 08:48:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 102. [2019-11-25 08:48:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-25 08:48:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2019-11-25 08:48:16,812 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 24 [2019-11-25 08:48:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:16,813 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2019-11-25 08:48:16,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:48:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2019-11-25 08:48:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:48:16,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:16,814 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, 1, 1, 1, 1, 1] [2019-11-25 08:48:16,814 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:16,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:16,815 INFO L82 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2019-11-25 08:48:16,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:16,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74410818] [2019-11-25 08:48:16,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:48:16,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74410818] [2019-11-25 08:48:16,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:16,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:16,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090789474] [2019-11-25 08:48:16,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:48:16,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:16,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:48:16,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:16,876 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 5 states. [2019-11-25 08:48:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:16,985 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2019-11-25 08:48:16,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:48:16,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-25 08:48:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:16,986 INFO L225 Difference]: With dead ends: 149 [2019-11-25 08:48:16,986 INFO L226 Difference]: Without dead ends: 131 [2019-11-25 08:48:16,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-25 08:48:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-11-25 08:48:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-25 08:48:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2019-11-25 08:48:16,994 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 26 [2019-11-25 08:48:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:16,995 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2019-11-25 08:48:16,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:48:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2019-11-25 08:48:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:48:16,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:16,996 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, 1, 1, 1, 1, 1] [2019-11-25 08:48:16,996 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2019-11-25 08:48:16,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:16,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337059312] [2019-11-25 08:48:16,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:48:17,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337059312] [2019-11-25 08:48:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833405053] [2019-11-25 08:48:17,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:17,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:17,024 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 3 states. [2019-11-25 08:48:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:17,069 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. [2019-11-25 08:48:17,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:17,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:48:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:17,071 INFO L225 Difference]: With dead ends: 123 [2019-11-25 08:48:17,071 INFO L226 Difference]: Without dead ends: 121 [2019-11-25 08:48:17,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-25 08:48:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-25 08:48:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-25 08:48:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-11-25 08:48:17,078 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 26 [2019-11-25 08:48:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:17,079 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-11-25 08:48:17,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-11-25 08:48:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:48:17,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:17,080 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:17,080 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-11-25 08:48:17,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:17,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566470741] [2019-11-25 08:48:17,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:17,254 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-25 08:48:17,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566470741] [2019-11-25 08:48:17,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:17,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:48:17,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550065850] [2019-11-25 08:48:17,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:48:17,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:17,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:48:17,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:48:17,257 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 8 states. [2019-11-25 08:48:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:17,789 INFO L93 Difference]: Finished difference Result 285 states and 334 transitions. [2019-11-25 08:48:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:48:17,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-25 08:48:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:17,790 INFO L225 Difference]: With dead ends: 285 [2019-11-25 08:48:17,791 INFO L226 Difference]: Without dead ends: 283 [2019-11-25 08:48:17,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:48:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-25 08:48:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 128. [2019-11-25 08:48:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-25 08:48:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2019-11-25 08:48:17,800 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2019-11-25 08:48:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:17,800 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2019-11-25 08:48:17,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:48:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2019-11-25 08:48:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:48:17,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:17,801 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, 1, 1, 1, 1, 1] [2019-11-25 08:48:17,802 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:17,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2019-11-25 08:48:17,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:17,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881836112] [2019-11-25 08:48:17,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:17,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881836112] [2019-11-25 08:48:17,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224641312] [2019-11-25 08:48:17,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/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-25 08:48:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:17,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 08:48:17,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:17,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:48:17,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:18,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:18,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:48:18,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:18,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:18,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:18,016 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-25 08:48:18,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:18,037 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 21 treesize of output 20 [2019-11-25 08:48:18,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:18,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:18,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:18,054 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 21 treesize of output 20 [2019-11-25 08:48:18,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:18,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:18,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:18,065 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-25 08:48:18,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-25 08:48:18,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:18,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:18,171 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:18,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-25 08:48:18,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:18,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:18,177 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-25 08:48:18,177 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-11-25 08:48:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:18,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:48:18,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-11-25 08:48:18,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570289278] [2019-11-25 08:48:18,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:48:18,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:18,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:48:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:48:18,184 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand 8 states. [2019-11-25 08:48:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:18,478 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2019-11-25 08:48:18,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:48:18,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-25 08:48:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:18,479 INFO L225 Difference]: With dead ends: 232 [2019-11-25 08:48:18,479 INFO L226 Difference]: Without dead ends: 170 [2019-11-25 08:48:18,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:48:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-25 08:48:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2019-11-25 08:48:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-25 08:48:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2019-11-25 08:48:18,495 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 29 [2019-11-25 08:48:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:18,496 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2019-11-25 08:48:18,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:48:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2019-11-25 08:48:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:48:18,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:18,500 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:18,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:18,713 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2019-11-25 08:48:18,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:18,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108621478] [2019-11-25 08:48:18,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:18,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108621478] [2019-11-25 08:48:18,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142036262] [2019-11-25 08:48:18,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/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-25 08:48:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:18,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:48:18,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:19,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:19,102 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 23 treesize of output 15 [2019-11-25 08:48:19,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:19,107 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 23 treesize of output 19 [2019-11-25 08:48:19,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:19,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:19,123 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-25 08:48:19,123 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:19,125 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-25 08:48:19,126 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:19,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:19,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:48:19,134 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2019-11-25 08:48:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:19,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:48:19,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-11-25 08:48:19,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335557174] [2019-11-25 08:48:19,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:48:19,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:19,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:48:19,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:48:19,156 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand 7 states. [2019-11-25 08:48:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:19,503 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2019-11-25 08:48:19,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:48:19,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-25 08:48:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:19,505 INFO L225 Difference]: With dead ends: 193 [2019-11-25 08:48:19,505 INFO L226 Difference]: Without dead ends: 173 [2019-11-25 08:48:19,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:48:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-25 08:48:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2019-11-25 08:48:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-25 08:48:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-11-25 08:48:19,513 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 29 [2019-11-25 08:48:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:19,513 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-11-25 08:48:19,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:48:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-11-25 08:48:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 08:48:19,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:19,514 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:19,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:19,725 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2019-11-25 08:48:19,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:19,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101589314] [2019-11-25 08:48:19,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:19,821 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-25 08:48:19,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101589314] [2019-11-25 08:48:19,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896582201] [2019-11-25 08:48:19,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/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-25 08:48:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:19,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:48:19,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:19,900 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-25 08:48:19,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:19,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:19,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:19,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-25 08:48:19,961 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-25 08:48:19,978 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-25 08:48:19,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:19,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:19,993 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-25 08:48:19,994 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-25 08:48:19,994 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:20,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:20,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:20,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2019-11-25 08:48:20,012 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-25 08:48:20,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:48:20,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-11-25 08:48:20,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449266824] [2019-11-25 08:48:20,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:48:20,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:48:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:48:20,019 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2019-11-25 08:48:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:20,290 INFO L93 Difference]: Finished difference Result 233 states and 265 transitions. [2019-11-25 08:48:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:48:20,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-25 08:48:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:20,292 INFO L225 Difference]: With dead ends: 233 [2019-11-25 08:48:20,292 INFO L226 Difference]: Without dead ends: 202 [2019-11-25 08:48:20,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:48:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-25 08:48:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 146. [2019-11-25 08:48:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:48:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2019-11-25 08:48:20,304 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 32 [2019-11-25 08:48:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:20,304 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2019-11-25 08:48:20,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:48:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2019-11-25 08:48:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 08:48:20,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:20,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:20,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:20,516 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:20,516 INFO L82 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2019-11-25 08:48:20,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:20,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494115000] [2019-11-25 08:48:20,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:20,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494115000] [2019-11-25 08:48:20,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:20,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:20,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311375472] [2019-11-25 08:48:20,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:20,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:20,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:20,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:20,543 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand 3 states. [2019-11-25 08:48:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:20,566 INFO L93 Difference]: Finished difference Result 308 states and 380 transitions. [2019-11-25 08:48:20,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:20,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-25 08:48:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:20,568 INFO L225 Difference]: With dead ends: 308 [2019-11-25 08:48:20,568 INFO L226 Difference]: Without dead ends: 214 [2019-11-25 08:48:20,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-25 08:48:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 171. [2019-11-25 08:48:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-25 08:48:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2019-11-25 08:48:20,579 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2019-11-25 08:48:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:20,579 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2019-11-25 08:48:20,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2019-11-25 08:48:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:48:20,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:20,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:20,580 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2019-11-25 08:48:20,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:20,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167510482] [2019-11-25 08:48:20,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:20,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167510482] [2019-11-25 08:48:20,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320290578] [2019-11-25 08:48:20,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/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-25 08:48:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:20,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 08:48:20,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:48:20,916 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-25 08:48:20,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:20,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:20,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:20,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:48:20,945 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-25 08:48:20,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:20,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:20,956 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-25 08:48:20,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:20,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:20,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:20,963 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-25 08:48:20,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:20,998 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-25 08:48:20,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:21,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:21,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:21,029 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 37 treesize of output 27 [2019-11-25 08:48:21,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:21,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:21,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:21,050 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 37 treesize of output 27 [2019-11-25 08:48:21,051 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:21,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:21,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:21,086 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:47 [2019-11-25 08:48:21,124 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_37|], 12=[|v_#memory_$Pointer$.base_36|]} [2019-11-25 08:48:21,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:21,130 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 42 treesize of output 40 [2019-11-25 08:48:21,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:21,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:21,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:21,270 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-11-25 08:48:21,270 INFO L343 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2019-11-25 08:48:21,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2019-11-25 08:48:21,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:48:21,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:21,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:48:21,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-25 08:48:21,336 INFO L567 ElimStorePlain]: treesize reduction 273, result has 22.2 percent of original size [2019-11-25 08:48:21,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:48:21,337 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2019-11-25 08:48:21,436 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 10=[|#memory_$Pointer$.base|]} [2019-11-25 08:48:21,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:48:21,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2019-11-25 08:48:21,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:21,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:21,518 INFO L343 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-11-25 08:48:21,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2019-11-25 08:48:21,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:48:21,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:48:21,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:48:21,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:48:21,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:48:21,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:48:21,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:48:21,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2019-11-25 08:48:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:21,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:48:21,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-25 08:48:21,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774749787] [2019-11-25 08:48:21,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 08:48:21,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:48:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:48:21,543 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand 13 states. [2019-11-25 08:48:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:22,453 INFO L93 Difference]: Finished difference Result 479 states and 569 transitions. [2019-11-25 08:48:22,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 08:48:22,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-11-25 08:48:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:22,456 INFO L225 Difference]: With dead ends: 479 [2019-11-25 08:48:22,456 INFO L226 Difference]: Without dead ends: 387 [2019-11-25 08:48:22,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2019-11-25 08:48:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-25 08:48:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 205. [2019-11-25 08:48:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-25 08:48:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2019-11-25 08:48:22,470 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 36 [2019-11-25 08:48:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:22,470 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2019-11-25 08:48:22,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 08:48:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2019-11-25 08:48:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:48:22,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:22,472 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:22,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:48:22,676 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2019-11-25 08:48:22,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:22,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030355483] [2019-11-25 08:48:22,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:48:22,732 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:48:22,732 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:48:22,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:48:22 BoogieIcfgContainer [2019-11-25 08:48:22,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:48:22,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:48:22,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:48:22,791 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:48:22,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:13" (3/4) ... [2019-11-25 08:48:22,793 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:48:22,846 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5efe1f5f-0f94-4545-938c-7290bfa31b2d/bin/uautomizer/witness.graphml [2019-11-25 08:48:22,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:48:22,848 INFO L168 Benchmark]: Toolchain (without parser) took 10105.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 944.7 MB in the beginning and 948.6 MB in the end (delta: -3.9 MB). Peak memory consumption was 188.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:22,848 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:48:22,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:22,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:22,849 INFO L168 Benchmark]: Boogie Preprocessor took 57.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:48:22,850 INFO L168 Benchmark]: RCFGBuilder took 568.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:22,850 INFO L168 Benchmark]: TraceAbstraction took 8807.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 956.8 MB in the end (delta: 123.9 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:22,850 INFO L168 Benchmark]: Witness Printer took 56.28 ms. Allocated memory is still 1.2 GB. Free memory was 956.8 MB in the beginning and 948.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:48:22,857 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 561.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 568.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8807.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 956.8 MB in the end (delta: 123.9 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * Witness Printer took 56.28 ms. Allocated memory is still 1.2 GB. Free memory was 956.8 MB in the beginning and 948.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) [L993] COND FALSE !(!(list != ((void*)0))) [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list [L1012] COND FALSE !(!(((void*)0) != end)) [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner [L1020] COND TRUE len == 0 [L1021] len = 1 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner [L1020] COND FALSE !(len == 0) [L1023] len = 2 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 13 error locations. Result: UNSAFE, OverallTime: 8.7s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1413 SDtfs, 2534 SDslu, 2750 SDs, 0 SdLazy, 1602 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 805 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 523 ConstructedInterpolants, 10 QuantifiedInterpolants, 187056 SizeOfPredicates, 41 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 8/19 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...