./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/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.25-f470102 [2019-12-07 13:03:06,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:03:06,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:03:06,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:03:06,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:03:06,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:03:06,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:03:06,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:03:06,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:03:06,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:03:06,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:03:06,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:03:06,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:03:06,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:03:06,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:03:06,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:03:06,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:03:06,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:03:06,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:03:06,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:03:06,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:03:06,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:03:06,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:03:06,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:03:06,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:03:06,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:03:06,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:03:06,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:03:06,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:03:06,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:03:06,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:03:06,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:03:06,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:03:06,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:03:06,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:03:06,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:03:06,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:03:06,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:03:06,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:03:06,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:03:06,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:03:06,085 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:03:06,097 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:03:06,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:03:06,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:03:06,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:03:06,099 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:03:06,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:03:06,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:03:06,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:03:06,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:03:06,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:03:06,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:03:06,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:03:06,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:03:06,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:03:06,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:03:06,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:03:06,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:03:06,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:03:06,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:03:06,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:03:06,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:03:06,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:03:06,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:03:06,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:03:06,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:03:06,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:03:06,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:03:06,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:03:06,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:03:06,104 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_8e51d06b-750d-45a6-8542-39f58f79cce2/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-12-07 13:03:06,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:03:06,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:03:06,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:03:06,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:03:06,244 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:03:06,245 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2019-12-07 13:03:06,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/data/7c7e85233/6b83941bc259454ba7c3dc9df56d73c8/FLAG5af1039d3 [2019-12-07 13:03:06,720 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:03:06,721 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/sv-benchmarks/c/forester-heap/sll-01-2.i [2019-12-07 13:03:06,731 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/data/7c7e85233/6b83941bc259454ba7c3dc9df56d73c8/FLAG5af1039d3 [2019-12-07 13:03:06,739 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/data/7c7e85233/6b83941bc259454ba7c3dc9df56d73c8 [2019-12-07 13:03:06,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:03:06,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:03:06,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:03:06,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:03:06,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:03:06,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:03:06" (1/1) ... [2019-12-07 13:03:06,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf817c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:06, skipping insertion in model container [2019-12-07 13:03:06,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:03:06" (1/1) ... [2019-12-07 13:03:06,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:03:06,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:03:06,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:03:06,987 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:03:07,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:03:07,047 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:03:07,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07 WrapperNode [2019-12-07 13:03:07,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:03:07,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:03:07,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:03:07,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:03:07,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... [2019-12-07 13:03:07,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... [2019-12-07 13:03:07,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:03:07,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:03:07,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:03:07,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:03:07,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... [2019-12-07 13:03:07,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... [2019-12-07 13:03:07,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... [2019-12-07 13:03:07,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... [2019-12-07 13:03:07,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... [2019-12-07 13:03:07,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... [2019-12-07 13:03:07,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... [2019-12-07 13:03:07,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:03:07,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:03:07,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:03:07,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:03:07,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/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-12-07 13:03:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:03:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:03:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:03:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:03:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:03:07,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:03:07,411 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:03:07,411 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-12-07 13:03:07,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:03:07 BoogieIcfgContainer [2019-12-07 13:03:07,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:03:07,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:03:07,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:03:07,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:03:07,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:03:06" (1/3) ... [2019-12-07 13:03:07,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522eb658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:03:07, skipping insertion in model container [2019-12-07 13:03:07,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:03:07" (2/3) ... [2019-12-07 13:03:07,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522eb658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:03:07, skipping insertion in model container [2019-12-07 13:03:07,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:03:07" (3/3) ... [2019-12-07 13:03:07,417 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2019-12-07 13:03:07,423 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:03:07,428 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-12-07 13:03:07,435 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-12-07 13:03:07,451 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:03:07,452 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:03:07,452 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:03:07,452 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:03:07,452 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:03:07,452 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:03:07,452 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:03:07,452 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:03:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-12-07 13:03:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 13:03:07,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:07,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 13:03:07,469 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-12-07 13:03:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-12-07 13:03:07,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:07,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185953156] [2019-12-07 13:03:07,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:07,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185953156] [2019-12-07 13:03:07,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:07,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:03:07,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618229269] [2019-12-07 13:03:07,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:03:07,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:07,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:03:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:03:07,592 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-12-07 13:03:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:07,631 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2019-12-07 13:03:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:03:07,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 13:03:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:07,639 INFO L225 Difference]: With dead ends: 182 [2019-12-07 13:03:07,639 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 13:03:07,641 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-12-07 13:03:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 13:03:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-12-07 13:03:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 13:03:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-12-07 13:03:07,668 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2019-12-07 13:03:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:07,669 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-12-07 13:03:07,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:03:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-12-07 13:03:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:03:07,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:07,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:03:07,670 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-12-07 13:03:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-12-07 13:03:07,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:07,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097201495] [2019-12-07 13:03:07,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:07,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097201495] [2019-12-07 13:03:07,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:07,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:03:07,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681776842] [2019-12-07 13:03:07,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:03:07,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:03:07,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:03:07,698 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 3 states. [2019-12-07 13:03:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:07,710 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-12-07 13:03:07,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:03:07,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 13:03:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:07,711 INFO L225 Difference]: With dead ends: 81 [2019-12-07 13:03:07,711 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 13:03:07,712 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-12-07 13:03:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 13:03:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-12-07 13:03:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 13:03:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-12-07 13:03:07,719 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2019-12-07 13:03:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:07,719 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-12-07 13:03:07,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:03:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-12-07 13:03:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:03:07,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:07,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:03:07,720 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-12-07 13:03:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-12-07 13:03:07,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:07,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757208090] [2019-12-07 13:03:07,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:07,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757208090] [2019-12-07 13:03:07,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:07,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:03:07,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382205144] [2019-12-07 13:03:07,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:03:07,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:07,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:03:07,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:03:07,759 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2019-12-07 13:03:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:07,805 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-12-07 13:03:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:03:07,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 13:03:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:07,806 INFO L225 Difference]: With dead ends: 80 [2019-12-07 13:03:07,806 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 13:03:07,806 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-12-07 13:03:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 13:03:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-12-07 13:03:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 13:03:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-12-07 13:03:07,811 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2019-12-07 13:03:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:07,811 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-12-07 13:03:07,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:03:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-12-07 13:03:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:03:07,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:07,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:03:07,812 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-12-07 13:03:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-12-07 13:03:07,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:07,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947982867] [2019-12-07 13:03:07,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:07,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947982867] [2019-12-07 13:03:07,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:07,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:03:07,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553712218] [2019-12-07 13:03:07,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:03:07,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:03:07,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:03:07,839 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 3 states. [2019-12-07 13:03:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:07,870 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2019-12-07 13:03:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:03:07,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 13:03:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:07,871 INFO L225 Difference]: With dead ends: 79 [2019-12-07 13:03:07,871 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 13:03:07,872 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-12-07 13:03:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 13:03:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-12-07 13:03:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 13:03:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-12-07 13:03:07,876 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2019-12-07 13:03:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:07,876 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-12-07 13:03:07,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:03:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-12-07 13:03:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:03:07,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:07,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:03:07,877 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-12-07 13:03:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2019-12-07 13:03:07,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:07,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405381355] [2019-12-07 13:03:07,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:07,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405381355] [2019-12-07 13:03:07,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:07,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:03:07,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576812346] [2019-12-07 13:03:07,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:03:07,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:03:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:03:07,907 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-12-07 13:03:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:07,975 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2019-12-07 13:03:07,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:03:07,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:03:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:07,977 INFO L225 Difference]: With dead ends: 190 [2019-12-07 13:03:07,977 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 13:03:07,978 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-12-07 13:03:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 13:03:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2019-12-07 13:03:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 13:03:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-12-07 13:03:07,985 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2019-12-07 13:03:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:07,985 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-12-07 13:03:07,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:03:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-12-07 13:03:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:03:07,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:07,986 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:03:07,986 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-12-07 13:03:07,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:07,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-12-07 13:03:07,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:07,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960562754] [2019-12-07 13:03:07,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:08,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960562754] [2019-12-07 13:03:08,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:08,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:03:08,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458579664] [2019-12-07 13:03:08,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:03:08,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:08,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:03:08,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:03:08,029 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 5 states. [2019-12-07 13:03:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:08,086 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2019-12-07 13:03:08,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:03:08,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 13:03:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:08,087 INFO L225 Difference]: With dead ends: 134 [2019-12-07 13:03:08,087 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 13:03:08,087 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-12-07 13:03:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 13:03:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2019-12-07 13:03:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 13:03:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-12-07 13:03:08,092 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2019-12-07 13:03:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:08,092 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-12-07 13:03:08,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:03:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-12-07 13:03:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:03:08,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:08,093 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-12-07 13:03:08,093 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-12-07 13:03:08,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:08,093 INFO L82 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2019-12-07 13:03:08,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:08,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567955233] [2019-12-07 13:03:08,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:08,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567955233] [2019-12-07 13:03:08,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:08,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:03:08,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014291476] [2019-12-07 13:03:08,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:03:08,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:08,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:03:08,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:03:08,115 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 3 states. [2019-12-07 13:03:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:08,128 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2019-12-07 13:03:08,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:03:08,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:03:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:08,129 INFO L225 Difference]: With dead ends: 139 [2019-12-07 13:03:08,129 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 13:03:08,130 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-12-07 13:03:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 13:03:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2019-12-07 13:03:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 13:03:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-12-07 13:03:08,134 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2019-12-07 13:03:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:08,135 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-12-07 13:03:08,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:03:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-12-07 13:03:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:03:08,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:08,135 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-12-07 13:03:08,136 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-12-07 13:03:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-12-07 13:03:08,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:08,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735084435] [2019-12-07 13:03:08,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:08,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735084435] [2019-12-07 13:03:08,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:08,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:03:08,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908288513] [2019-12-07 13:03:08,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:03:08,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:08,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:03:08,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:03:08,157 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2019-12-07 13:03:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:08,169 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-12-07 13:03:08,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:03:08,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 13:03:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:08,170 INFO L225 Difference]: With dead ends: 76 [2019-12-07 13:03:08,170 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 13:03:08,170 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-12-07 13:03:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 13:03:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 13:03:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 13:03:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-12-07 13:03:08,174 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2019-12-07 13:03:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:08,174 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-12-07 13:03:08,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:03:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-12-07 13:03:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:03:08,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:08,175 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-12-07 13:03:08,175 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-12-07 13:03:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:08,176 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-12-07 13:03:08,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:08,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385933672] [2019-12-07 13:03:08,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:08,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385933672] [2019-12-07 13:03:08,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:08,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:03:08,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939696318] [2019-12-07 13:03:08,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:03:08,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:08,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:03:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:03:08,208 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2019-12-07 13:03:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:08,258 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-12-07 13:03:08,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:03:08,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 13:03:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:08,259 INFO L225 Difference]: With dead ends: 75 [2019-12-07 13:03:08,259 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 13:03:08,260 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-12-07 13:03:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 13:03:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-12-07 13:03:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 13:03:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-12-07 13:03:08,264 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2019-12-07 13:03:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:08,265 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-12-07 13:03:08,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:03:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-12-07 13:03:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:03:08,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:08,266 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-12-07 13:03:08,266 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-12-07 13:03:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:08,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-12-07 13:03:08,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:08,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356890615] [2019-12-07 13:03:08,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:08,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356890615] [2019-12-07 13:03:08,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:08,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:03:08,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233449515] [2019-12-07 13:03:08,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:03:08,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:03:08,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:03:08,330 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 6 states. [2019-12-07 13:03:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:08,479 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2019-12-07 13:03:08,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:03:08,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 13:03:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:08,480 INFO L225 Difference]: With dead ends: 178 [2019-12-07 13:03:08,481 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 13:03:08,481 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-12-07 13:03:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 13:03:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2019-12-07 13:03:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 13:03:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-12-07 13:03:08,485 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2019-12-07 13:03:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:08,486 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-12-07 13:03:08,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:03:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-12-07 13:03:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:03:08,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:08,487 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-12-07 13:03:08,487 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-12-07 13:03:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:08,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-12-07 13:03:08,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:08,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93972956] [2019-12-07 13:03:08,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:08,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93972956] [2019-12-07 13:03:08,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:08,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:03:08,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514185938] [2019-12-07 13:03:08,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:03:08,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:08,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:03:08,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:03:08,672 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 8 states. [2019-12-07 13:03:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:09,083 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2019-12-07 13:03:09,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:03:09,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-07 13:03:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:09,085 INFO L225 Difference]: With dead ends: 190 [2019-12-07 13:03:09,085 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 13:03:09,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:03:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 13:03:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 102. [2019-12-07 13:03:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 13:03:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2019-12-07 13:03:09,091 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 24 [2019-12-07 13:03:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:09,092 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2019-12-07 13:03:09,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:03:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2019-12-07 13:03:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:03:09,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:09,092 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-12-07 13:03:09,093 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-12-07 13:03:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2019-12-07 13:03:09,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:09,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335016476] [2019-12-07 13:03:09,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:03:09,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335016476] [2019-12-07 13:03:09,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:09,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:03:09,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211565202] [2019-12-07 13:03:09,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:03:09,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:09,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:03:09,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:03:09,129 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 5 states. [2019-12-07 13:03:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:09,197 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2019-12-07 13:03:09,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:03:09,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 13:03:09,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:09,198 INFO L225 Difference]: With dead ends: 149 [2019-12-07 13:03:09,198 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 13:03:09,199 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-12-07 13:03:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 13:03:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-12-07 13:03:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 13:03:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2019-12-07 13:03:09,203 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 26 [2019-12-07 13:03:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:09,204 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2019-12-07 13:03:09,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:03:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2019-12-07 13:03:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:03:09,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:09,205 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-12-07 13:03:09,205 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-12-07 13:03:09,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2019-12-07 13:03:09,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:09,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45641211] [2019-12-07 13:03:09,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:03:09,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45641211] [2019-12-07 13:03:09,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:09,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:03:09,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998248135] [2019-12-07 13:03:09,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:03:09,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:09,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:03:09,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:03:09,225 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 3 states. [2019-12-07 13:03:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:09,259 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. [2019-12-07 13:03:09,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:03:09,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 13:03:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:09,261 INFO L225 Difference]: With dead ends: 123 [2019-12-07 13:03:09,261 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 13:03:09,261 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-12-07 13:03:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 13:03:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-12-07 13:03:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 13:03:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-12-07 13:03:09,268 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 26 [2019-12-07 13:03:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:09,268 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-12-07 13:03:09,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:03:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-12-07 13:03:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:03:09,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:09,270 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-12-07 13:03:09,270 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-12-07 13:03:09,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:09,270 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-12-07 13:03:09,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:09,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50764361] [2019-12-07 13:03:09,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:09,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50764361] [2019-12-07 13:03:09,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:09,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:03:09,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082833711] [2019-12-07 13:03:09,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:03:09,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:09,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:03:09,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:03:09,381 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 8 states. [2019-12-07 13:03:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:09,696 INFO L93 Difference]: Finished difference Result 285 states and 334 transitions. [2019-12-07 13:03:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:03:09,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 13:03:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:09,698 INFO L225 Difference]: With dead ends: 285 [2019-12-07 13:03:09,698 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 13:03:09,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:03:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 13:03:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 128. [2019-12-07 13:03:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 13:03:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2019-12-07 13:03:09,705 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2019-12-07 13:03:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:09,705 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2019-12-07 13:03:09,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:03:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2019-12-07 13:03:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:03:09,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:09,705 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-12-07 13:03:09,706 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-12-07 13:03:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2019-12-07 13:03:09,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:09,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431545438] [2019-12-07 13:03:09,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:09,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431545438] [2019-12-07 13:03:09,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825645116] [2019-12-07 13:03:09,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/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-12-07 13:03:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:09,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 13:03:09,783 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:03:09,821 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-12-07 13:03:09,821 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:09,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:09,829 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-12-07 13:03:09,830 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:09,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:09,834 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:09,834 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 13:03:09,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:09,850 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-12-07 13:03:09,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:09,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:09,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:09,861 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-12-07 13:03:09,861 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:09,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:09,868 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:09,869 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 13:03:09,906 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-12-07 13:03:09,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:09,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:09,914 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:09,914 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-12-07 13:03:09,914 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:09,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:09,917 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:09,918 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-12-07 13:03:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:09,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:03:09,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-12-07 13:03:09,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354800402] [2019-12-07 13:03:09,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:03:09,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:03:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:03:09,922 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand 8 states. [2019-12-07 13:03:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:10,123 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2019-12-07 13:03:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:03:10,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 13:03:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:10,124 INFO L225 Difference]: With dead ends: 232 [2019-12-07 13:03:10,124 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 13:03:10,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:03:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 13:03:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2019-12-07 13:03:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 13:03:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2019-12-07 13:03:10,130 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 29 [2019-12-07 13:03:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:10,130 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2019-12-07 13:03:10,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:03:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2019-12-07 13:03:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:03:10,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:10,131 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-12-07 13:03:10,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:03:10,332 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-12-07 13:03:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2019-12-07 13:03:10,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:10,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477162778] [2019-12-07 13:03:10,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:10,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477162778] [2019-12-07 13:03:10,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70404905] [2019-12-07 13:03:10,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/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-12-07 13:03:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:10,597 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 13:03:10,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:03:10,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:10,664 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-12-07 13:03:10,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:10,666 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 7 treesize of output 3 [2019-12-07 13:03:10,666 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:10,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:10,675 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 7 treesize of output 3 [2019-12-07 13:03:10,675 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:10,677 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-12-07 13:03:10,677 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:10,682 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:10,682 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 13:03:10,682 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2019-12-07 13:03:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:10,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:03:10,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-12-07 13:03:10,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295351835] [2019-12-07 13:03:10,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:03:10,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:03:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:03:10,695 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand 7 states. [2019-12-07 13:03:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:10,910 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2019-12-07 13:03:10,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:03:10,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-07 13:03:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:10,911 INFO L225 Difference]: With dead ends: 193 [2019-12-07 13:03:10,911 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 13:03:10,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:03:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 13:03:10,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2019-12-07 13:03:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 13:03:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-12-07 13:03:10,917 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 29 [2019-12-07 13:03:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:10,917 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-12-07 13:03:10,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:03:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-12-07 13:03:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:03:10,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:10,918 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-12-07 13:03:11,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:03:11,119 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-12-07 13:03:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2019-12-07 13:03:11,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:11,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843397796] [2019-12-07 13:03:11,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:11,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843397796] [2019-12-07 13:03:11,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382383342] [2019-12-07 13:03:11,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/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-12-07 13:03:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:11,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 13:03:11,242 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:03:11,245 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-12-07 13:03:11,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:11,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:11,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:11,247 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:03:11,287 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-12-07 13:03:11,289 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-12-07 13:03:11,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:11,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:11,303 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 13:03:11,303 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-12-07 13:03:11,304 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:11,306 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:11,306 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:11,307 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2019-12-07 13:03:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:11,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:03:11,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-12-07 13:03:11,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775291263] [2019-12-07 13:03:11,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:03:11,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:11,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:03:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:03:11,310 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2019-12-07 13:03:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:11,522 INFO L93 Difference]: Finished difference Result 233 states and 265 transitions. [2019-12-07 13:03:11,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:03:11,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-07 13:03:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:11,523 INFO L225 Difference]: With dead ends: 233 [2019-12-07 13:03:11,523 INFO L226 Difference]: Without dead ends: 202 [2019-12-07 13:03:11,524 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-12-07 13:03:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-12-07 13:03:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 146. [2019-12-07 13:03:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:03:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2019-12-07 13:03:11,532 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 32 [2019-12-07 13:03:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:11,532 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2019-12-07 13:03:11,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:03:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2019-12-07 13:03:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:03:11,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:11,533 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-12-07 13:03:11,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:03:11,734 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-12-07 13:03:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2019-12-07 13:03:11,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:11,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926908263] [2019-12-07 13:03:11,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:11,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926908263] [2019-12-07 13:03:11,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:11,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:03:11,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819714465] [2019-12-07 13:03:11,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:03:11,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:11,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:03:11,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:03:11,782 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand 3 states. [2019-12-07 13:03:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:11,803 INFO L93 Difference]: Finished difference Result 308 states and 380 transitions. [2019-12-07 13:03:11,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:03:11,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 13:03:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:11,804 INFO L225 Difference]: With dead ends: 308 [2019-12-07 13:03:11,804 INFO L226 Difference]: Without dead ends: 214 [2019-12-07 13:03:11,805 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-12-07 13:03:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-12-07 13:03:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 171. [2019-12-07 13:03:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 13:03:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2019-12-07 13:03:11,810 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2019-12-07 13:03:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:11,811 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2019-12-07 13:03:11,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:03:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2019-12-07 13:03:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 13:03:11,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:11,811 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-12-07 13:03:11,811 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-12-07 13:03:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2019-12-07 13:03:11,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:11,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815373317] [2019-12-07 13:03:11,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:11,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815373317] [2019-12-07 13:03:11,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673621762] [2019-12-07 13:03:11,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/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-12-07 13:03:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:11,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 13:03:11,981 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:03:11,986 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-12-07 13:03:11,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:11,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:11,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:11,990 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:03:11,995 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-12-07 13:03:11,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:12,004 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-12-07 13:03:12,004 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:12,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,018 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-12-07 13:03:12,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:12,049 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-12-07 13:03:12,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:12,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:12,071 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-12-07 13:03:12,071 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:12,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:12,086 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-12-07 13:03:12,086 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:12,096 INFO L534 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-12-07 13:03:12,096 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:47 [2019-12-07 13:03:12,117 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_37|], 12=[|v_#memory_$Pointer$.base_36|]} [2019-12-07 13:03:12,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:12,123 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-12-07 13:03:12,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:12,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:12,193 INFO L343 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2019-12-07 13:03:12,193 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-12-07 13:03:12,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:03:12,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:12,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:12,197 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 13:03:12,236 INFO L614 ElimStorePlain]: treesize reduction 273, result has 22.2 percent of original size [2019-12-07 13:03:12,237 INFO L534 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-12-07 13:03:12,237 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2019-12-07 13:03:12,309 INFO L430 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 10=[|#memory_$Pointer$.base|]} [2019-12-07 13:03:12,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:12,313 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-12-07 13:03:12,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:12,361 INFO L343 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-12-07 13:03:12,361 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-12-07 13:03:12,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:03:12,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:03:12,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:03:12,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:03:12,363 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,366 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:12,366 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:12,366 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2019-12-07 13:03:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:03:12,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:03:12,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-12-07 13:03:12,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941937891] [2019-12-07 13:03:12,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:03:12,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:03:12,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:03:12,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:03:12,377 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand 13 states. [2019-12-07 13:03:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:13,040 INFO L93 Difference]: Finished difference Result 479 states and 569 transitions. [2019-12-07 13:03:13,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 13:03:13,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-12-07 13:03:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:13,041 INFO L225 Difference]: With dead ends: 479 [2019-12-07 13:03:13,041 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 13:03:13,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:03:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 13:03:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 205. [2019-12-07 13:03:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-12-07 13:03:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2019-12-07 13:03:13,050 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 36 [2019-12-07 13:03:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:13,050 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2019-12-07 13:03:13,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:03:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2019-12-07 13:03:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 13:03:13,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:13,051 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-12-07 13:03:13,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:03:13,252 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-12-07 13:03:13,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:13,253 INFO L82 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2019-12-07 13:03:13,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:03:13,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180351084] [2019-12-07 13:03:13,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:03:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:03:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:03:13,320 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:03:13,320 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:03:13,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:03:13 BoogieIcfgContainer [2019-12-07 13:03:13,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:03:13,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:03:13,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:03:13,346 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:03:13,346 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:03:07" (3/4) ... [2019-12-07 13:03:13,347 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:03:13,378 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8e51d06b-750d-45a6-8542-39f58f79cce2/bin/uautomizer/witness.graphml [2019-12-07 13:03:13,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:03:13,379 INFO L168 Benchmark]: Toolchain (without parser) took 6637.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.4 MB in the beginning and 907.7 MB in the end (delta: 31.7 MB). Peak memory consumption was 173.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:03:13,379 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:03:13,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -131.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:03:13,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.41 ms. Allocated memory is still 1.1 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-12-07 13:03:13,380 INFO L168 Benchmark]: Boogie Preprocessor took 25.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:03:13,380 INFO L168 Benchmark]: RCFGBuilder took 304.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:03:13,380 INFO L168 Benchmark]: TraceAbstraction took 5932.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.0 GB in the beginning and 916.0 MB in the end (delta: 109.2 MB). Peak memory consumption was 164.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:03:13,381 INFO L168 Benchmark]: Witness Printer took 32.73 ms. Allocated memory is still 1.2 GB. Free memory was 916.0 MB in the beginning and 907.7 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:03:13,382 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -131.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.41 ms. Allocated memory is still 1.1 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 25.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 304.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5932.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.0 GB in the beginning and 916.0 MB in the end (delta: 109.2 MB). Peak memory consumption was 164.8 MB. Max. memory is 11.5 GB. * Witness Printer took 32.73 ms. Allocated memory is still 1.2 GB. Free memory was 916.0 MB in the beginning and 907.7 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 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: 5.8s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1413 SDtfs, 2534 SDslu, 2750 SDs, 0 SdLazy, 1602 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.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.1s SatisfiabilityAnalysisTime, 1.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...