./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/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 c8531c852aede4d90d76778a05ed8837cee15399 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/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 c8531c852aede4d90d76778a05ed8837cee15399 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:36:10,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:36:10,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:36:10,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:36:10,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:36:10,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:36:10,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:36:10,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:36:10,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:36:10,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:36:10,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:36:10,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:36:10,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:36:10,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:36:10,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:36:10,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:36:10,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:36:10,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:36:10,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:36:10,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:36:10,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:36:10,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:36:10,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:36:10,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:36:10,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:36:10,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:36:10,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:36:10,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:36:10,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:36:10,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:36:10,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:36:10,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:36:10,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:36:10,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:36:10,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:36:10,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:36:10,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:36:10,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:36:10,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:36:10,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:36:10,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:36:10,733 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:36:10,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:36:10,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:36:10,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:36:10,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:36:10,746 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:36:10,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:36:10,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:36:10,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:36:10,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:36:10,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:36:10,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:36:10,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:36:10,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:36:10,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:36:10,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:36:10,748 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:36:10,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:36:10,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:36:10,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:36:10,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:36:10,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:36:10,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:36:10,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:36:10,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:36:10,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:36:10,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:36:10,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:36:10,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:36:10,751 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_c473c216-7858-4122-af9d-18722c69793e/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 -> c8531c852aede4d90d76778a05ed8837cee15399 [2019-11-15 22:36:10,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:36:10,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:36:10,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:36:10,795 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:36:10,796 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:36:10,796 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c [2019-11-15 22:36:10,858 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data/867177c32/b1dced05f7fc4bd0b1ad1b6d66135a9d/FLAG69d14904a [2019-11-15 22:36:11,348 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:36:11,353 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c [2019-11-15 22:36:11,383 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data/867177c32/b1dced05f7fc4bd0b1ad1b6d66135a9d/FLAG69d14904a [2019-11-15 22:36:11,596 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data/867177c32/b1dced05f7fc4bd0b1ad1b6d66135a9d [2019-11-15 22:36:11,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:36:11,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:36:11,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:36:11,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:36:11,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:36:11,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:36:11" (1/1) ... [2019-11-15 22:36:11,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f05a4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:11, skipping insertion in model container [2019-11-15 22:36:11,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:36:11" (1/1) ... [2019-11-15 22:36:11,620 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:36:11,676 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:36:12,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:36:12,166 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:36:12,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:36:12,304 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:36:12,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12 WrapperNode [2019-11-15 22:36:12,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:36:12,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:36:12,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:36:12,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:36:12,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... [2019-11-15 22:36:12,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... [2019-11-15 22:36:12,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:36:12,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:36:12,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:36:12,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:36:12,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... [2019-11-15 22:36:12,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... [2019-11-15 22:36:12,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... [2019-11-15 22:36:12,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... [2019-11-15 22:36:12,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... [2019-11-15 22:36:12,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... [2019-11-15 22:36:12,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... [2019-11-15 22:36:12,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:36:12,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:36:12,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:36:12,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:36:12,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:36:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:36:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:36:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:36:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:36:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:36:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:36:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:36:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:36:12,846 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:36:13,789 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:36:13,789 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:36:13,790 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:36:13,790 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:36:13,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:36:13 BoogieIcfgContainer [2019-11-15 22:36:13,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:36:13,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:36:13,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:36:13,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:36:13,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:36:11" (1/3) ... [2019-11-15 22:36:13,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c91038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:36:13, skipping insertion in model container [2019-11-15 22:36:13,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:12" (2/3) ... [2019-11-15 22:36:13,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c91038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:36:13, skipping insertion in model container [2019-11-15 22:36:13,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:36:13" (3/3) ... [2019-11-15 22:36:13,802 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-2.c [2019-11-15 22:36:13,811 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:36:13,820 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:36:13,831 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:36:13,852 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:36:13,853 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:36:13,853 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:36:13,853 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:36:13,853 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:36:13,853 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:36:13,853 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:36:13,853 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:36:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-15 22:36:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:36:13,879 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:13,880 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:13,882 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:13,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-15 22:36:13,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:13,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868448343] [2019-11-15 22:36:13,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:13,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:13,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:14,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868448343] [2019-11-15 22:36:14,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:14,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:14,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467079734] [2019-11-15 22:36:14,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:14,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:14,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:14,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:14,209 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-15 22:36:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:14,681 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-15 22:36:14,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:14,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 22:36:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:14,705 INFO L225 Difference]: With dead ends: 313 [2019-11-15 22:36:14,705 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 22:36:14,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 22:36:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-15 22:36:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:36:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-15 22:36:14,764 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-15 22:36:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:14,765 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-15 22:36:14,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-15 22:36:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 22:36:14,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:14,768 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:14,768 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:14,769 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-15 22:36:14,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:14,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063720532] [2019-11-15 22:36:14,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:14,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:14,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:14,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063720532] [2019-11-15 22:36:14,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:14,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:14,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411589350] [2019-11-15 22:36:14,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:14,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:14,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:14,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:14,910 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-15 22:36:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:15,331 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-15 22:36:15,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:15,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 22:36:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:15,334 INFO L225 Difference]: With dead ends: 280 [2019-11-15 22:36:15,334 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 22:36:15,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 22:36:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-15 22:36:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:36:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-15 22:36:15,360 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-15 22:36:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:15,360 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-15 22:36:15,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-15 22:36:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:36:15,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:15,369 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1] [2019-11-15 22:36:15,370 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:15,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-15 22:36:15,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:15,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739153912] [2019-11-15 22:36:15,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:15,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:15,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:15,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739153912] [2019-11-15 22:36:15,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:15,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:15,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112617226] [2019-11-15 22:36:15,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:15,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:15,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:15,583 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-15 22:36:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:15,952 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-15 22:36:15,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:15,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:36:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:15,954 INFO L225 Difference]: With dead ends: 279 [2019-11-15 22:36:15,955 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 22:36:15,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 22:36:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-15 22:36:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:36:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-15 22:36:15,965 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-15 22:36:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:15,966 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-15 22:36:15,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-15 22:36:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:36:15,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:15,968 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:15,968 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-15 22:36:15,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:15,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907113238] [2019-11-15 22:36:15,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:15,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:15,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:16,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907113238] [2019-11-15 22:36:16,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:16,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:16,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786398373] [2019-11-15 22:36:16,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:16,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:16,046 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-15 22:36:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:16,370 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-15 22:36:16,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:16,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:36:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:16,372 INFO L225 Difference]: With dead ends: 277 [2019-11-15 22:36:16,372 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 22:36:16,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 22:36:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-15 22:36:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:36:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-15 22:36:16,381 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-15 22:36:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:16,381 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-15 22:36:16,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-15 22:36:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:36:16,383 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:16,383 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:16,383 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-15 22:36:16,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:16,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800843574] [2019-11-15 22:36:16,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:16,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:16,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:16,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800843574] [2019-11-15 22:36:16,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:16,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:16,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896771928] [2019-11-15 22:36:16,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:16,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:16,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:16,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:16,481 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-15 22:36:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:16,776 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-15 22:36:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:16,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:36:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:16,778 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:36:16,778 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 22:36:16,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 22:36:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 22:36:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:36:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-15 22:36:16,786 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-15 22:36:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:16,786 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-15 22:36:16,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-15 22:36:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:36:16,787 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:16,787 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:16,788 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:16,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:16,788 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-15 22:36:16,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:16,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926181849] [2019-11-15 22:36:16,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:16,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:16,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:16,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926181849] [2019-11-15 22:36:16,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:16,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:16,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320218043] [2019-11-15 22:36:16,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:16,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:16,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:16,859 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-15 22:36:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:17,142 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-15 22:36:17,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:17,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:36:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:17,146 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:36:17,146 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 22:36:17,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 22:36:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 22:36:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:36:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-15 22:36:17,153 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-15 22:36:17,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:17,153 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-15 22:36:17,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-15 22:36:17,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:36:17,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:17,155 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:17,155 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:17,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:17,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-15 22:36:17,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:17,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068807678] [2019-11-15 22:36:17,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:17,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:17,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:17,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068807678] [2019-11-15 22:36:17,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:17,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:17,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77941107] [2019-11-15 22:36:17,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:17,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:17,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:17,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:17,207 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-15 22:36:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:17,451 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-15 22:36:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:17,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 22:36:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:17,453 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:36:17,454 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 22:36:17,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 22:36:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 22:36:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:36:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-15 22:36:17,459 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-15 22:36:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:17,459 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-15 22:36:17,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-15 22:36:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 22:36:17,460 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:17,460 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:17,461 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-15 22:36:17,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:17,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633047147] [2019-11-15 22:36:17,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:17,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:17,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:17,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633047147] [2019-11-15 22:36:17,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:17,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:17,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770888581] [2019-11-15 22:36:17,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:17,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:17,522 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-15 22:36:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:17,889 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-15 22:36:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:17,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 22:36:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:17,891 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:36:17,891 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 22:36:17,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 22:36:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 22:36:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:36:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-15 22:36:17,896 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-15 22:36:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:17,896 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-15 22:36:17,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-15 22:36:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:36:17,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:17,898 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:17,898 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:17,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-15 22:36:17,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:17,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936206512] [2019-11-15 22:36:17,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:17,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:17,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:17,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936206512] [2019-11-15 22:36:17,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:17,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:17,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231034079] [2019-11-15 22:36:17,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:17,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:17,966 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-15 22:36:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:18,234 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-15 22:36:18,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:18,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 22:36:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:18,236 INFO L225 Difference]: With dead ends: 266 [2019-11-15 22:36:18,236 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 22:36:18,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 22:36:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-15 22:36:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:36:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-15 22:36:18,241 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-15 22:36:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:18,246 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-15 22:36:18,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-15 22:36:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:36:18,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:18,247 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:18,247 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:18,248 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-15 22:36:18,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:18,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097928823] [2019-11-15 22:36:18,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:18,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:18,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:18,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097928823] [2019-11-15 22:36:18,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:18,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:18,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760217414] [2019-11-15 22:36:18,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:18,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:18,331 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-15 22:36:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:18,636 INFO L93 Difference]: Finished difference Result 307 states and 462 transitions. [2019-11-15 22:36:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:18,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 22:36:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:18,638 INFO L225 Difference]: With dead ends: 307 [2019-11-15 22:36:18,638 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:36:18,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:36:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-15 22:36:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:36:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-15 22:36:18,644 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-15 22:36:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:18,645 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-15 22:36:18,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-15 22:36:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:36:18,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:18,646 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:18,647 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-15 22:36:18,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:18,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552526723] [2019-11-15 22:36:18,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:18,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:18,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:18,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552526723] [2019-11-15 22:36:18,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:18,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:18,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777854457] [2019-11-15 22:36:18,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:18,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:18,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:18,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:18,698 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-15 22:36:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:19,031 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2019-11-15 22:36:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:19,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 22:36:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:19,035 INFO L225 Difference]: With dead ends: 329 [2019-11-15 22:36:19,035 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:36:19,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:36:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-15 22:36:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:36:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-15 22:36:19,041 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-15 22:36:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:19,041 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-15 22:36:19,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-15 22:36:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:36:19,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:19,046 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:19,046 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:19,046 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-15 22:36:19,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:19,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936443454] [2019-11-15 22:36:19,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:19,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:19,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:19,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936443454] [2019-11-15 22:36:19,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:19,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:19,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863791878] [2019-11-15 22:36:19,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:19,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:19,103 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-15 22:36:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:19,469 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2019-11-15 22:36:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:19,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:36:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:19,471 INFO L225 Difference]: With dead ends: 328 [2019-11-15 22:36:19,471 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 22:36:19,472 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 22:36:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-15 22:36:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:36:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-15 22:36:19,477 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-15 22:36:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:19,477 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-15 22:36:19,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-15 22:36:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:36:19,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:19,481 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:19,481 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-15 22:36:19,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:19,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159438799] [2019-11-15 22:36:19,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:19,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:19,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:19,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159438799] [2019-11-15 22:36:19,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:19,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:19,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990968092] [2019-11-15 22:36:19,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:19,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:19,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:19,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:19,547 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-15 22:36:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:19,879 INFO L93 Difference]: Finished difference Result 326 states and 492 transitions. [2019-11-15 22:36:19,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:19,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:36:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:19,881 INFO L225 Difference]: With dead ends: 326 [2019-11-15 22:36:19,881 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 22:36:19,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 22:36:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2019-11-15 22:36:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:36:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-15 22:36:19,888 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-15 22:36:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:19,890 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-15 22:36:19,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-15 22:36:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:36:19,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:19,891 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:19,891 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:19,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-15 22:36:19,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:19,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671388528] [2019-11-15 22:36:19,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:19,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:19,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:19,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671388528] [2019-11-15 22:36:19,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:19,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:19,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666454937] [2019-11-15 22:36:19,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:19,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:19,955 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-15 22:36:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:20,348 INFO L93 Difference]: Finished difference Result 325 states and 489 transitions. [2019-11-15 22:36:20,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:20,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:36:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:20,350 INFO L225 Difference]: With dead ends: 325 [2019-11-15 22:36:20,351 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 22:36:20,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 22:36:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 22:36:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:36:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-15 22:36:20,356 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-15 22:36:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:20,356 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-15 22:36:20,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-15 22:36:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:36:20,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:20,359 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:20,359 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-15 22:36:20,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:20,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983514231] [2019-11-15 22:36:20,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:20,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:20,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:20,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983514231] [2019-11-15 22:36:20,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:20,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:20,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416333895] [2019-11-15 22:36:20,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:20,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:20,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:20,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:20,411 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-15 22:36:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:20,777 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2019-11-15 22:36:20,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:20,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:36:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:20,779 INFO L225 Difference]: With dead ends: 325 [2019-11-15 22:36:20,779 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 22:36:20,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 22:36:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 22:36:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:36:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-15 22:36:20,789 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-15 22:36:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:20,790 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-15 22:36:20,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-15 22:36:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 22:36:20,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:20,791 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:20,792 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-15 22:36:20,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:20,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386469824] [2019-11-15 22:36:20,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:20,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:20,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:20,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386469824] [2019-11-15 22:36:20,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:20,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:20,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932110236] [2019-11-15 22:36:20,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:20,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:20,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:20,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:20,857 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-15 22:36:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:21,235 INFO L93 Difference]: Finished difference Result 325 states and 485 transitions. [2019-11-15 22:36:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:21,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 22:36:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:21,237 INFO L225 Difference]: With dead ends: 325 [2019-11-15 22:36:21,238 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 22:36:21,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:21,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 22:36:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 22:36:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:36:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-15 22:36:21,246 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-15 22:36:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:21,246 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-15 22:36:21,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-15 22:36:21,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 22:36:21,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:21,248 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:21,248 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:21,248 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-15 22:36:21,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:21,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542316661] [2019-11-15 22:36:21,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:21,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:21,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:21,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542316661] [2019-11-15 22:36:21,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:21,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:21,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274586544] [2019-11-15 22:36:21,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:21,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:21,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:21,309 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-15 22:36:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:21,684 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2019-11-15 22:36:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:21,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 22:36:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:21,686 INFO L225 Difference]: With dead ends: 325 [2019-11-15 22:36:21,686 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 22:36:21,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 22:36:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 22:36:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:36:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-15 22:36:21,691 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-15 22:36:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:21,692 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-15 22:36:21,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-15 22:36:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 22:36:21,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:21,693 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:21,693 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-15 22:36:21,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:21,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319477512] [2019-11-15 22:36:21,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:21,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:21,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:21,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319477512] [2019-11-15 22:36:21,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:21,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:21,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801541879] [2019-11-15 22:36:21,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:21,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:21,744 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-15 22:36:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:22,018 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2019-11-15 22:36:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:22,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-15 22:36:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:22,020 INFO L225 Difference]: With dead ends: 315 [2019-11-15 22:36:22,020 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 22:36:22,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 22:36:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-11-15 22:36:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 22:36:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-15 22:36:22,025 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-15 22:36:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:22,026 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-15 22:36:22,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-15 22:36:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:36:22,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:22,027 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:22,027 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash 719124867, now seen corresponding path program 1 times [2019-11-15 22:36:22,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:22,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279088076] [2019-11-15 22:36:22,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:22,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:22,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:22,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279088076] [2019-11-15 22:36:22,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:22,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:22,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682357878] [2019-11-15 22:36:22,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:22,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:22,104 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-15 22:36:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:22,568 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-11-15 22:36:22,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:22,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 22:36:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:22,571 INFO L225 Difference]: With dead ends: 403 [2019-11-15 22:36:22,571 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 22:36:22,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 22:36:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-11-15 22:36:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 22:36:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-15 22:36:22,577 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-15 22:36:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:22,578 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-15 22:36:22,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-15 22:36:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:36:22,579 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:22,579 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:22,579 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash -178268411, now seen corresponding path program 1 times [2019-11-15 22:36:22,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:22,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56494446] [2019-11-15 22:36:22,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:22,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:22,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:22,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56494446] [2019-11-15 22:36:22,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:22,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:22,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533498226] [2019-11-15 22:36:22,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:22,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:22,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:22,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:22,673 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-15 22:36:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:23,058 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2019-11-15 22:36:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:23,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 22:36:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:23,061 INFO L225 Difference]: With dead ends: 443 [2019-11-15 22:36:23,061 INFO L226 Difference]: Without dead ends: 256 [2019-11-15 22:36:23,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-15 22:36:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-15 22:36:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 22:36:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-15 22:36:23,069 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-15 22:36:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:23,069 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-15 22:36:23,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-15 22:36:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:36:23,071 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:23,071 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:23,071 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2081210466, now seen corresponding path program 1 times [2019-11-15 22:36:23,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:23,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438862775] [2019-11-15 22:36:23,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:23,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:23,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:23,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438862775] [2019-11-15 22:36:23,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:23,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:23,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555434607] [2019-11-15 22:36:23,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:23,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:23,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:23,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:23,169 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-15 22:36:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:23,704 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-11-15 22:36:23,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:23,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:36:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:23,707 INFO L225 Difference]: With dead ends: 494 [2019-11-15 22:36:23,707 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 22:36:23,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 22:36:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-11-15 22:36:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 22:36:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-15 22:36:23,717 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-15 22:36:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:23,717 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-15 22:36:23,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-15 22:36:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:36:23,719 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:23,719 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:23,719 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2121885216, now seen corresponding path program 1 times [2019-11-15 22:36:23,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:23,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831222026] [2019-11-15 22:36:23,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:23,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:23,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:23,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831222026] [2019-11-15 22:36:23,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:23,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:23,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393335522] [2019-11-15 22:36:23,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:23,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:23,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:23,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:23,798 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-15 22:36:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:24,224 INFO L93 Difference]: Finished difference Result 467 states and 726 transitions. [2019-11-15 22:36:24,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:24,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:36:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:24,228 INFO L225 Difference]: With dead ends: 467 [2019-11-15 22:36:24,228 INFO L226 Difference]: Without dead ends: 256 [2019-11-15 22:36:24,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-15 22:36:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-15 22:36:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 22:36:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-15 22:36:24,235 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-15 22:36:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:24,235 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-15 22:36:24,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-15 22:36:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:36:24,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:24,237 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:24,237 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:24,237 INFO L82 PathProgramCache]: Analyzing trace with hash -314494398, now seen corresponding path program 1 times [2019-11-15 22:36:24,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:24,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990119711] [2019-11-15 22:36:24,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:24,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:24,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:24,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990119711] [2019-11-15 22:36:24,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:24,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:24,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802269870] [2019-11-15 22:36:24,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:24,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:24,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:24,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:24,310 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-15 22:36:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:24,859 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-11-15 22:36:24,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:24,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:36:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:24,862 INFO L225 Difference]: With dead ends: 493 [2019-11-15 22:36:24,863 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 22:36:24,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 22:36:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-15 22:36:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 22:36:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-15 22:36:24,871 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-15 22:36:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:24,872 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-15 22:36:24,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-15 22:36:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:36:24,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:24,874 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:24,874 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:24,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1028699053, now seen corresponding path program 1 times [2019-11-15 22:36:24,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:24,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830452996] [2019-11-15 22:36:24,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:24,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:24,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:24,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830452996] [2019-11-15 22:36:24,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:24,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:24,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268450236] [2019-11-15 22:36:24,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:24,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:24,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:24,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:24,959 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-15 22:36:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:25,423 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-11-15 22:36:25,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:25,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:36:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:25,426 INFO L225 Difference]: With dead ends: 491 [2019-11-15 22:36:25,426 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 22:36:25,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 22:36:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-11-15 22:36:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 22:36:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-15 22:36:25,435 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-15 22:36:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:25,435 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-15 22:36:25,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-15 22:36:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:36:25,437 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:25,437 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:25,437 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1978047213, now seen corresponding path program 1 times [2019-11-15 22:36:25,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:25,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139923235] [2019-11-15 22:36:25,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:25,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:25,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:25,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139923235] [2019-11-15 22:36:25,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:25,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:25,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492536571] [2019-11-15 22:36:25,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:25,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:25,528 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-15 22:36:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:25,955 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-11-15 22:36:25,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:25,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:36:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:25,956 INFO L225 Difference]: With dead ends: 490 [2019-11-15 22:36:25,956 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 22:36:25,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 22:36:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-15 22:36:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 22:36:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-15 22:36:25,963 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-15 22:36:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:25,964 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-15 22:36:25,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-15 22:36:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:36:25,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:25,965 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:25,965 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash 523516374, now seen corresponding path program 1 times [2019-11-15 22:36:25,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:25,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165567350] [2019-11-15 22:36:25,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:25,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:25,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:36:26,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165567350] [2019-11-15 22:36:26,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:26,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:36:26,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046666255] [2019-11-15 22:36:26,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:36:26,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:36:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:26,041 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-15 22:36:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:26,579 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-15 22:36:26,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:36:26,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-15 22:36:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:26,581 INFO L225 Difference]: With dead ends: 462 [2019-11-15 22:36:26,581 INFO L226 Difference]: Without dead ends: 251 [2019-11-15 22:36:26,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:36:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-15 22:36:26,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-15 22:36:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-15 22:36:26,590 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-15 22:36:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:26,591 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-15 22:36:26,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:36:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-15 22:36:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:36:26,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:26,592 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:26,592 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2005350993, now seen corresponding path program 1 times [2019-11-15 22:36:26,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:26,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920002699] [2019-11-15 22:36:26,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:26,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:26,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:26,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920002699] [2019-11-15 22:36:26,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:26,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:26,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296792367] [2019-11-15 22:36:26,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:26,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:26,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:26,686 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-15 22:36:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:26,969 INFO L93 Difference]: Finished difference Result 504 states and 766 transitions. [2019-11-15 22:36:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:26,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:36:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:26,971 INFO L225 Difference]: With dead ends: 504 [2019-11-15 22:36:26,971 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 22:36:26,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 22:36:26,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 250. [2019-11-15 22:36:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-15 22:36:26,978 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-15 22:36:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:26,978 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-15 22:36:26,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-15 22:36:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:36:26,979 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:26,980 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:26,980 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1056002833, now seen corresponding path program 1 times [2019-11-15 22:36:26,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:26,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569939818] [2019-11-15 22:36:26,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:26,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:26,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:27,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569939818] [2019-11-15 22:36:27,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:27,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:27,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084702097] [2019-11-15 22:36:27,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:27,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:27,043 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-15 22:36:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:27,319 INFO L93 Difference]: Finished difference Result 503 states and 763 transitions. [2019-11-15 22:36:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:27,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:36:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:27,320 INFO L225 Difference]: With dead ends: 503 [2019-11-15 22:36:27,320 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 22:36:27,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 22:36:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 22:36:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-15 22:36:27,327 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-15 22:36:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:27,328 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-15 22:36:27,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-15 22:36:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:36:27,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:27,329 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:27,329 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:27,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:27,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1449434210, now seen corresponding path program 1 times [2019-11-15 22:36:27,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:27,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659778728] [2019-11-15 22:36:27,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:27,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:27,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:27,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659778728] [2019-11-15 22:36:27,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:27,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:27,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026392320] [2019-11-15 22:36:27,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:27,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:27,386 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-15 22:36:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:27,860 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-11-15 22:36:27,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:27,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 22:36:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:27,862 INFO L225 Difference]: With dead ends: 530 [2019-11-15 22:36:27,862 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:36:27,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:36:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-15 22:36:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-15 22:36:27,871 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-15 22:36:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:27,871 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-15 22:36:27,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-15 22:36:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:36:27,872 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:27,873 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:27,873 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:27,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:27,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1015705124, now seen corresponding path program 1 times [2019-11-15 22:36:27,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:27,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765007251] [2019-11-15 22:36:27,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:27,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:27,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:27,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765007251] [2019-11-15 22:36:27,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:27,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:27,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904928990] [2019-11-15 22:36:27,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:27,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:27,942 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-15 22:36:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:28,258 INFO L93 Difference]: Finished difference Result 503 states and 759 transitions. [2019-11-15 22:36:28,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:28,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 22:36:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:28,260 INFO L225 Difference]: With dead ends: 503 [2019-11-15 22:36:28,260 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 22:36:28,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 22:36:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 22:36:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-15 22:36:28,267 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-15 22:36:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:28,268 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-15 22:36:28,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-15 22:36:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:36:28,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:28,269 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:28,269 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash 542245225, now seen corresponding path program 1 times [2019-11-15 22:36:28,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:28,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091296444] [2019-11-15 22:36:28,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:28,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:28,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:28,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091296444] [2019-11-15 22:36:28,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:28,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:28,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962692147] [2019-11-15 22:36:28,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:28,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:28,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:28,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:28,341 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-15 22:36:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:28,795 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-11-15 22:36:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:28,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 22:36:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:28,798 INFO L225 Difference]: With dead ends: 530 [2019-11-15 22:36:28,798 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:36:28,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:36:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-15 22:36:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-15 22:36:28,805 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-15 22:36:28,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:28,806 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-15 22:36:28,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-15 22:36:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:36:28,807 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:28,807 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:28,807 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:28,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945003, now seen corresponding path program 1 times [2019-11-15 22:36:28,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:28,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156405813] [2019-11-15 22:36:28,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:28,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:28,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:28,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156405813] [2019-11-15 22:36:28,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:28,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:28,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861853241] [2019-11-15 22:36:28,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:28,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:28,874 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-15 22:36:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:29,201 INFO L93 Difference]: Finished difference Result 503 states and 755 transitions. [2019-11-15 22:36:29,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:29,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 22:36:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:29,203 INFO L225 Difference]: With dead ends: 503 [2019-11-15 22:36:29,204 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 22:36:29,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 22:36:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 22:36:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-15 22:36:29,213 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-15 22:36:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:29,213 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-15 22:36:29,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-15 22:36:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 22:36:29,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:29,215 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:29,215 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash 952064921, now seen corresponding path program 1 times [2019-11-15 22:36:29,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:29,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143010650] [2019-11-15 22:36:29,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:29,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:29,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:29,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143010650] [2019-11-15 22:36:29,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:29,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:29,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414156733] [2019-11-15 22:36:29,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:29,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:29,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:29,271 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-15 22:36:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:29,686 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-11-15 22:36:29,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:29,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 22:36:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:29,688 INFO L225 Difference]: With dead ends: 530 [2019-11-15 22:36:29,689 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:36:29,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:36:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-15 22:36:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-15 22:36:29,697 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-15 22:36:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:29,697 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-15 22:36:29,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-15 22:36:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 22:36:29,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:29,700 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:29,700 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1153888855, now seen corresponding path program 1 times [2019-11-15 22:36:29,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:29,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762831167] [2019-11-15 22:36:29,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:29,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:29,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:29,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762831167] [2019-11-15 22:36:29,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:29,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:29,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332735021] [2019-11-15 22:36:29,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:29,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:29,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:29,757 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-15 22:36:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:30,119 INFO L93 Difference]: Finished difference Result 503 states and 751 transitions. [2019-11-15 22:36:30,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:30,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 22:36:30,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:30,121 INFO L225 Difference]: With dead ends: 503 [2019-11-15 22:36:30,121 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 22:36:30,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 22:36:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 22:36:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-15 22:36:30,131 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-15 22:36:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:30,131 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-15 22:36:30,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-15 22:36:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 22:36:30,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:30,133 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:30,133 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:30,134 INFO L82 PathProgramCache]: Analyzing trace with hash -431127036, now seen corresponding path program 1 times [2019-11-15 22:36:30,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:30,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173182031] [2019-11-15 22:36:30,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:30,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:30,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:30,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173182031] [2019-11-15 22:36:30,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:30,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:30,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716078426] [2019-11-15 22:36:30,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:30,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:30,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:30,202 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-15 22:36:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:30,586 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-11-15 22:36:30,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:30,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 22:36:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:30,588 INFO L225 Difference]: With dead ends: 520 [2019-11-15 22:36:30,588 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:36:30,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:36:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-15 22:36:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-15 22:36:30,596 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-15 22:36:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:30,596 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-15 22:36:30,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-15 22:36:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 22:36:30,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:30,597 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:30,598 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:30,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:30,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1530447622, now seen corresponding path program 1 times [2019-11-15 22:36:30,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:30,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051240270] [2019-11-15 22:36:30,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:30,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:30,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:30,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051240270] [2019-11-15 22:36:30,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:30,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:30,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383654767] [2019-11-15 22:36:30,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:30,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:30,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:30,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:30,671 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-15 22:36:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:30,889 INFO L93 Difference]: Finished difference Result 493 states and 735 transitions. [2019-11-15 22:36:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:30,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 22:36:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:30,891 INFO L225 Difference]: With dead ends: 493 [2019-11-15 22:36:30,891 INFO L226 Difference]: Without dead ends: 262 [2019-11-15 22:36:30,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-15 22:36:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2019-11-15 22:36:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-15 22:36:30,897 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-15 22:36:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:30,898 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-15 22:36:30,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-15 22:36:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 22:36:30,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:30,899 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:30,900 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1853395595, now seen corresponding path program 1 times [2019-11-15 22:36:30,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:30,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583490656] [2019-11-15 22:36:30,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:30,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:30,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:36:30,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583490656] [2019-11-15 22:36:30,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:30,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:30,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109697648] [2019-11-15 22:36:30,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:30,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:30,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:30,968 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-15 22:36:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:31,277 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-11-15 22:36:31,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:31,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-15 22:36:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:31,279 INFO L225 Difference]: With dead ends: 520 [2019-11-15 22:36:31,279 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:36:31,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:36:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-15 22:36:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:36:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-15 22:36:31,288 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-15 22:36:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:31,288 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-15 22:36:31,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-15 22:36:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 22:36:31,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:31,290 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:31,290 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 167215757, now seen corresponding path program 1 times [2019-11-15 22:36:31,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:31,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534335671] [2019-11-15 22:36:31,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:31,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:31,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:36:31,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534335671] [2019-11-15 22:36:31,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:31,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:36:31,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743437794] [2019-11-15 22:36:31,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:36:31,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:36:31,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:36:31,393 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-15 22:36:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:31,427 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-15 22:36:31,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:36:31,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 22:36:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:31,430 INFO L225 Difference]: With dead ends: 710 [2019-11-15 22:36:31,430 INFO L226 Difference]: Without dead ends: 479 [2019-11-15 22:36:31,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:36:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-15 22:36:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-15 22:36:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-15 22:36:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-15 22:36:31,443 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-15 22:36:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:31,443 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-15 22:36:31,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:36:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-15 22:36:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 22:36:31,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:31,445 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 22:36:31,446 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-11-15 22:36:31,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:31,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792361955] [2019-11-15 22:36:31,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:31,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:31,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:36:31,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792361955] [2019-11-15 22:36:31,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:31,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:36:31,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253643363] [2019-11-15 22:36:31,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:36:31,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:31,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:36:31,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:36:31,509 INFO L87 Difference]: Start difference. First operand 479 states and 711 transitions. Second operand 3 states. [2019-11-15 22:36:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:31,547 INFO L93 Difference]: Finished difference Result 710 states and 1057 transitions. [2019-11-15 22:36:31,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:36:31,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-15 22:36:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:31,551 INFO L225 Difference]: With dead ends: 710 [2019-11-15 22:36:31,552 INFO L226 Difference]: Without dead ends: 708 [2019-11-15 22:36:31,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:36:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-11-15 22:36:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-11-15 22:36:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-11-15 22:36:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1055 transitions. [2019-11-15 22:36:31,571 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1055 transitions. Word has length 125 [2019-11-15 22:36:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:31,571 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1055 transitions. [2019-11-15 22:36:31,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:36:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1055 transitions. [2019-11-15 22:36:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-15 22:36:31,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:31,574 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:36:31,574 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash -921484902, now seen corresponding path program 1 times [2019-11-15 22:36:31,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:31,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197936924] [2019-11-15 22:36:31,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:31,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:31,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-15 22:36:31,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197936924] [2019-11-15 22:36:31,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:31,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:31,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519252859] [2019-11-15 22:36:31,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:31,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:31,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:31,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:31,673 INFO L87 Difference]: Start difference. First operand 708 states and 1055 transitions. Second operand 4 states. [2019-11-15 22:36:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:32,289 INFO L93 Difference]: Finished difference Result 1696 states and 2545 transitions. [2019-11-15 22:36:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:32,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-15 22:36:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:32,295 INFO L225 Difference]: With dead ends: 1696 [2019-11-15 22:36:32,295 INFO L226 Difference]: Without dead ends: 1007 [2019-11-15 22:36:32,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-15 22:36:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 774. [2019-11-15 22:36:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-11-15 22:36:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1166 transitions. [2019-11-15 22:36:32,318 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1166 transitions. Word has length 170 [2019-11-15 22:36:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:32,318 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1166 transitions. [2019-11-15 22:36:32,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1166 transitions. [2019-11-15 22:36:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-15 22:36:32,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:32,320 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:32,321 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:32,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1322898733, now seen corresponding path program 1 times [2019-11-15 22:36:32,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:32,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117865110] [2019-11-15 22:36:32,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:32,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:32,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-15 22:36:32,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117865110] [2019-11-15 22:36:32,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:32,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:32,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183616336] [2019-11-15 22:36:32,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:32,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:32,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:32,395 INFO L87 Difference]: Start difference. First operand 774 states and 1166 transitions. Second operand 4 states. [2019-11-15 22:36:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:32,960 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2019-11-15 22:36:32,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:32,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-15 22:36:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:32,966 INFO L225 Difference]: With dead ends: 1747 [2019-11-15 22:36:32,967 INFO L226 Difference]: Without dead ends: 992 [2019-11-15 22:36:32,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-11-15 22:36:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 777. [2019-11-15 22:36:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-15 22:36:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1169 transitions. [2019-11-15 22:36:32,996 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1169 transitions. Word has length 171 [2019-11-15 22:36:32,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:32,996 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1169 transitions. [2019-11-15 22:36:32,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1169 transitions. [2019-11-15 22:36:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 22:36:32,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:33,000 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:33,000 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:33,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:33,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1032298903, now seen corresponding path program 1 times [2019-11-15 22:36:33,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:33,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774003904] [2019-11-15 22:36:33,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:33,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:33,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-15 22:36:33,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774003904] [2019-11-15 22:36:33,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:33,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:33,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588506130] [2019-11-15 22:36:33,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:33,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:33,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:33,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:33,084 INFO L87 Difference]: Start difference. First operand 777 states and 1169 transitions. Second operand 4 states. [2019-11-15 22:36:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:33,643 INFO L93 Difference]: Finished difference Result 1834 states and 2773 transitions. [2019-11-15 22:36:33,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:33,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-15 22:36:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:33,649 INFO L225 Difference]: With dead ends: 1834 [2019-11-15 22:36:33,649 INFO L226 Difference]: Without dead ends: 1076 [2019-11-15 22:36:33,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-11-15 22:36:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 843. [2019-11-15 22:36:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-11-15 22:36:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1280 transitions. [2019-11-15 22:36:33,675 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1280 transitions. Word has length 183 [2019-11-15 22:36:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:33,675 INFO L462 AbstractCegarLoop]: Abstraction has 843 states and 1280 transitions. [2019-11-15 22:36:33,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1280 transitions. [2019-11-15 22:36:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 22:36:33,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:33,678 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:33,678 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:33,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash -463165468, now seen corresponding path program 1 times [2019-11-15 22:36:33,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:33,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433107527] [2019-11-15 22:36:33,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:33,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:33,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-15 22:36:33,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433107527] [2019-11-15 22:36:33,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:33,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:33,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444949589] [2019-11-15 22:36:33,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:33,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:33,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:33,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:33,824 INFO L87 Difference]: Start difference. First operand 843 states and 1280 transitions. Second operand 4 states. [2019-11-15 22:36:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:34,354 INFO L93 Difference]: Finished difference Result 1885 states and 2858 transitions. [2019-11-15 22:36:34,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:34,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-15 22:36:34,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:34,362 INFO L225 Difference]: With dead ends: 1885 [2019-11-15 22:36:34,362 INFO L226 Difference]: Without dead ends: 1061 [2019-11-15 22:36:34,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-15 22:36:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 777. [2019-11-15 22:36:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-15 22:36:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1169 transitions. [2019-11-15 22:36:34,388 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1169 transitions. Word has length 184 [2019-11-15 22:36:34,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:34,389 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1169 transitions. [2019-11-15 22:36:34,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1169 transitions. [2019-11-15 22:36:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 22:36:34,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:34,392 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:34,393 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash -315914064, now seen corresponding path program 1 times [2019-11-15 22:36:34,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:34,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074736983] [2019-11-15 22:36:34,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:34,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:34,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-15 22:36:34,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074736983] [2019-11-15 22:36:34,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:34,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:34,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531165829] [2019-11-15 22:36:34,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:34,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:34,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:34,495 INFO L87 Difference]: Start difference. First operand 777 states and 1169 transitions. Second operand 4 states. [2019-11-15 22:36:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:34,886 INFO L93 Difference]: Finished difference Result 1834 states and 2773 transitions. [2019-11-15 22:36:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:34,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-15 22:36:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:34,897 INFO L225 Difference]: With dead ends: 1834 [2019-11-15 22:36:34,897 INFO L226 Difference]: Without dead ends: 1076 [2019-11-15 22:36:34,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-11-15 22:36:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 843. [2019-11-15 22:36:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-11-15 22:36:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1280 transitions. [2019-11-15 22:36:34,928 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1280 transitions. Word has length 184 [2019-11-15 22:36:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:34,929 INFO L462 AbstractCegarLoop]: Abstraction has 843 states and 1280 transitions. [2019-11-15 22:36:34,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1280 transitions. [2019-11-15 22:36:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 22:36:34,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:34,932 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:34,933 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:34,933 INFO L82 PathProgramCache]: Analyzing trace with hash 269928061, now seen corresponding path program 1 times [2019-11-15 22:36:34,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:34,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994109102] [2019-11-15 22:36:34,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:34,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:34,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-15 22:36:35,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994109102] [2019-11-15 22:36:35,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:35,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:35,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294671247] [2019-11-15 22:36:35,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:35,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:35,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:35,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:35,023 INFO L87 Difference]: Start difference. First operand 843 states and 1280 transitions. Second operand 4 states. [2019-11-15 22:36:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:35,446 INFO L93 Difference]: Finished difference Result 1885 states and 2858 transitions. [2019-11-15 22:36:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:35,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-15 22:36:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:35,455 INFO L225 Difference]: With dead ends: 1885 [2019-11-15 22:36:35,456 INFO L226 Difference]: Without dead ends: 1061 [2019-11-15 22:36:35,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-15 22:36:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 777. [2019-11-15 22:36:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-15 22:36:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1169 transitions. [2019-11-15 22:36:35,480 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1169 transitions. Word has length 185 [2019-11-15 22:36:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:35,481 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1169 transitions. [2019-11-15 22:36:35,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1169 transitions. [2019-11-15 22:36:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 22:36:35,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:35,484 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:35,484 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2013811987, now seen corresponding path program 1 times [2019-11-15 22:36:35,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:35,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583868740] [2019-11-15 22:36:35,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:35,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:35,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:35,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583868740] [2019-11-15 22:36:35,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:35,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:35,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357825756] [2019-11-15 22:36:35,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:35,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:35,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:35,560 INFO L87 Difference]: Start difference. First operand 777 states and 1169 transitions. Second operand 4 states. [2019-11-15 22:36:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:35,902 INFO L93 Difference]: Finished difference Result 1819 states and 2744 transitions. [2019-11-15 22:36:35,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:35,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-15 22:36:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:35,906 INFO L225 Difference]: With dead ends: 1819 [2019-11-15 22:36:35,906 INFO L226 Difference]: Without dead ends: 1061 [2019-11-15 22:36:35,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-15 22:36:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 813. [2019-11-15 22:36:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 22:36:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1220 transitions. [2019-11-15 22:36:35,930 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1220 transitions. Word has length 185 [2019-11-15 22:36:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:35,930 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1220 transitions. [2019-11-15 22:36:35,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1220 transitions. [2019-11-15 22:36:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 22:36:35,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:35,933 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:35,933 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:35,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash 592864628, now seen corresponding path program 1 times [2019-11-15 22:36:35,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:35,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576810159] [2019-11-15 22:36:35,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:35,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:35,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:36,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576810159] [2019-11-15 22:36:36,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:36,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:36,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173503830] [2019-11-15 22:36:36,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:36,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:36,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:36,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:36,024 INFO L87 Difference]: Start difference. First operand 813 states and 1220 transitions. Second operand 4 states. [2019-11-15 22:36:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:36,523 INFO L93 Difference]: Finished difference Result 1855 states and 2792 transitions. [2019-11-15 22:36:36,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:36,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 22:36:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:36,531 INFO L225 Difference]: With dead ends: 1855 [2019-11-15 22:36:36,531 INFO L226 Difference]: Without dead ends: 1061 [2019-11-15 22:36:36,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-15 22:36:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 816. [2019-11-15 22:36:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-11-15 22:36:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1223 transitions. [2019-11-15 22:36:36,555 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1223 transitions. Word has length 186 [2019-11-15 22:36:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:36,556 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1223 transitions. [2019-11-15 22:36:36,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1223 transitions. [2019-11-15 22:36:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 22:36:36,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:36,558 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:36,559 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1121043182, now seen corresponding path program 1 times [2019-11-15 22:36:36,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:36,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593653746] [2019-11-15 22:36:36,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:36,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:36,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:36,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593653746] [2019-11-15 22:36:36,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:36,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:36,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645688474] [2019-11-15 22:36:36,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:36,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:36,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:36,642 INFO L87 Difference]: Start difference. First operand 816 states and 1223 transitions. Second operand 4 states. [2019-11-15 22:36:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:37,019 INFO L93 Difference]: Finished difference Result 1858 states and 2792 transitions. [2019-11-15 22:36:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:37,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-15 22:36:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:37,026 INFO L225 Difference]: With dead ends: 1858 [2019-11-15 22:36:37,026 INFO L226 Difference]: Without dead ends: 1061 [2019-11-15 22:36:37,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-15 22:36:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 819. [2019-11-15 22:36:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-11-15 22:36:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1226 transitions. [2019-11-15 22:36:37,044 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1226 transitions. Word has length 187 [2019-11-15 22:36:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:37,045 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1226 transitions. [2019-11-15 22:36:37,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1226 transitions. [2019-11-15 22:36:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 22:36:37,047 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:37,048 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-15 22:36:37,048 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:37,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:37,049 INFO L82 PathProgramCache]: Analyzing trace with hash 216285873, now seen corresponding path program 1 times [2019-11-15 22:36:37,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:37,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94801134] [2019-11-15 22:36:37,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:37,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:37,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:37,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94801134] [2019-11-15 22:36:37,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:37,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:37,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323305501] [2019-11-15 22:36:37,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:37,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:37,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:37,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:37,136 INFO L87 Difference]: Start difference. First operand 819 states and 1226 transitions. Second operand 4 states. [2019-11-15 22:36:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:37,668 INFO L93 Difference]: Finished difference Result 1861 states and 2792 transitions. [2019-11-15 22:36:37,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:37,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-15 22:36:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:37,673 INFO L225 Difference]: With dead ends: 1861 [2019-11-15 22:36:37,673 INFO L226 Difference]: Without dead ends: 1061 [2019-11-15 22:36:37,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-15 22:36:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 834. [2019-11-15 22:36:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-11-15 22:36:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1253 transitions. [2019-11-15 22:36:37,698 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1253 transitions. Word has length 187 [2019-11-15 22:36:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:37,699 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1253 transitions. [2019-11-15 22:36:37,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1253 transitions. [2019-11-15 22:36:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 22:36:37,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:37,701 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:37,701 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash 665885305, now seen corresponding path program 1 times [2019-11-15 22:36:37,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:37,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011532606] [2019-11-15 22:36:37,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:37,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:37,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:37,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011532606] [2019-11-15 22:36:37,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:37,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:37,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407524476] [2019-11-15 22:36:37,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:37,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:37,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:37,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:37,785 INFO L87 Difference]: Start difference. First operand 834 states and 1253 transitions. Second operand 4 states. [2019-11-15 22:36:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:38,316 INFO L93 Difference]: Finished difference Result 1846 states and 2780 transitions. [2019-11-15 22:36:38,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:38,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-15 22:36:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:38,322 INFO L225 Difference]: With dead ends: 1846 [2019-11-15 22:36:38,322 INFO L226 Difference]: Without dead ends: 1031 [2019-11-15 22:36:38,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-11-15 22:36:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 834. [2019-11-15 22:36:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-11-15 22:36:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1250 transitions. [2019-11-15 22:36:38,341 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1250 transitions. Word has length 188 [2019-11-15 22:36:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:38,341 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1250 transitions. [2019-11-15 22:36:38,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1250 transitions. [2019-11-15 22:36:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 22:36:38,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:38,344 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:36:38,344 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:38,344 INFO L82 PathProgramCache]: Analyzing trace with hash -188075789, now seen corresponding path program 1 times [2019-11-15 22:36:38,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:38,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340133647] [2019-11-15 22:36:38,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:38,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:38,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:38,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340133647] [2019-11-15 22:36:38,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:38,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:38,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581579279] [2019-11-15 22:36:38,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:38,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:38,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:38,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:38,427 INFO L87 Difference]: Start difference. First operand 834 states and 1250 transitions. Second operand 4 states. [2019-11-15 22:36:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:38,799 INFO L93 Difference]: Finished difference Result 1846 states and 2774 transitions. [2019-11-15 22:36:38,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:38,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-15 22:36:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:38,805 INFO L225 Difference]: With dead ends: 1846 [2019-11-15 22:36:38,805 INFO L226 Difference]: Without dead ends: 1031 [2019-11-15 22:36:38,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-11-15 22:36:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 837. [2019-11-15 22:36:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-11-15 22:36:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1253 transitions. [2019-11-15 22:36:38,825 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1253 transitions. Word has length 188 [2019-11-15 22:36:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:38,825 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1253 transitions. [2019-11-15 22:36:38,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1253 transitions. [2019-11-15 22:36:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 22:36:38,827 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:38,828 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:36:38,828 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:38,828 INFO L82 PathProgramCache]: Analyzing trace with hash 559305356, now seen corresponding path program 1 times [2019-11-15 22:36:38,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:38,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325062978] [2019-11-15 22:36:38,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:38,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:38,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:38,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325062978] [2019-11-15 22:36:38,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:38,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:38,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130618395] [2019-11-15 22:36:38,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:38,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:38,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:38,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:38,910 INFO L87 Difference]: Start difference. First operand 837 states and 1253 transitions. Second operand 4 states. [2019-11-15 22:36:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:39,263 INFO L93 Difference]: Finished difference Result 1840 states and 2762 transitions. [2019-11-15 22:36:39,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:39,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-15 22:36:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:39,268 INFO L225 Difference]: With dead ends: 1840 [2019-11-15 22:36:39,268 INFO L226 Difference]: Without dead ends: 1022 [2019-11-15 22:36:39,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-11-15 22:36:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 840. [2019-11-15 22:36:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-15 22:36:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1256 transitions. [2019-11-15 22:36:39,289 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1256 transitions. Word has length 189 [2019-11-15 22:36:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:39,289 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1256 transitions. [2019-11-15 22:36:39,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1256 transitions. [2019-11-15 22:36:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 22:36:39,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:39,291 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:39,291 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:39,291 INFO L82 PathProgramCache]: Analyzing trace with hash 178479314, now seen corresponding path program 2 times [2019-11-15 22:36:39,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:39,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802924856] [2019-11-15 22:36:39,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:39,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:39,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-15 22:36:39,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802924856] [2019-11-15 22:36:39,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:39,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:39,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951328706] [2019-11-15 22:36:39,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:39,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:39,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:39,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:39,378 INFO L87 Difference]: Start difference. First operand 840 states and 1256 transitions. Second operand 4 states. [2019-11-15 22:36:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:39,742 INFO L93 Difference]: Finished difference Result 1843 states and 2762 transitions. [2019-11-15 22:36:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:39,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 22:36:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:39,746 INFO L225 Difference]: With dead ends: 1843 [2019-11-15 22:36:39,747 INFO L226 Difference]: Without dead ends: 1022 [2019-11-15 22:36:39,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-11-15 22:36:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 849. [2019-11-15 22:36:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-11-15 22:36:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1265 transitions. [2019-11-15 22:36:39,772 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1265 transitions. Word has length 192 [2019-11-15 22:36:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:39,772 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-11-15 22:36:39,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1265 transitions. [2019-11-15 22:36:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 22:36:39,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:39,774 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-15 22:36:39,774 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:39,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:39,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1497734315, now seen corresponding path program 1 times [2019-11-15 22:36:39,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:39,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432830631] [2019-11-15 22:36:39,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:39,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:39,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-15 22:36:39,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432830631] [2019-11-15 22:36:39,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:39,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:39,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728987704] [2019-11-15 22:36:39,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:39,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:39,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:39,871 INFO L87 Difference]: Start difference. First operand 849 states and 1265 transitions. Second operand 4 states. [2019-11-15 22:36:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:40,386 INFO L93 Difference]: Finished difference Result 1840 states and 2753 transitions. [2019-11-15 22:36:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:40,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 22:36:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:40,395 INFO L225 Difference]: With dead ends: 1840 [2019-11-15 22:36:40,395 INFO L226 Difference]: Without dead ends: 1010 [2019-11-15 22:36:40,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-11-15 22:36:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 852. [2019-11-15 22:36:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-11-15 22:36:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1268 transitions. [2019-11-15 22:36:40,417 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1268 transitions. Word has length 193 [2019-11-15 22:36:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:40,417 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1268 transitions. [2019-11-15 22:36:40,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1268 transitions. [2019-11-15 22:36:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 22:36:40,419 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:40,419 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:40,420 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:40,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:40,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2027842374, now seen corresponding path program 1 times [2019-11-15 22:36:40,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:40,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572007216] [2019-11-15 22:36:40,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:40,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:40,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:36:40,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572007216] [2019-11-15 22:36:40,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:40,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:40,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504689470] [2019-11-15 22:36:40,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:40,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:40,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:40,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:40,504 INFO L87 Difference]: Start difference. First operand 852 states and 1268 transitions. Second operand 4 states. [2019-11-15 22:36:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:40,894 INFO L93 Difference]: Finished difference Result 1984 states and 2971 transitions. [2019-11-15 22:36:40,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:40,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-15 22:36:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:40,899 INFO L225 Difference]: With dead ends: 1984 [2019-11-15 22:36:40,900 INFO L226 Difference]: Without dead ends: 1151 [2019-11-15 22:36:40,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-11-15 22:36:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 918. [2019-11-15 22:36:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-11-15 22:36:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1379 transitions. [2019-11-15 22:36:40,932 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1379 transitions. Word has length 195 [2019-11-15 22:36:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:40,932 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 1379 transitions. [2019-11-15 22:36:40,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1379 transitions. [2019-11-15 22:36:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-15 22:36:40,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:40,934 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:40,935 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash -88066393, now seen corresponding path program 1 times [2019-11-15 22:36:40,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:40,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838545099] [2019-11-15 22:36:40,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:40,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:40,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-15 22:36:41,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838545099] [2019-11-15 22:36:41,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:41,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:41,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045764668] [2019-11-15 22:36:41,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:41,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:41,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:41,109 INFO L87 Difference]: Start difference. First operand 918 states and 1379 transitions. Second operand 4 states. [2019-11-15 22:36:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:41,467 INFO L93 Difference]: Finished difference Result 1975 states and 2975 transitions. [2019-11-15 22:36:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:41,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-11-15 22:36:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:41,470 INFO L225 Difference]: With dead ends: 1975 [2019-11-15 22:36:41,470 INFO L226 Difference]: Without dead ends: 1076 [2019-11-15 22:36:41,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-11-15 22:36:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 927. [2019-11-15 22:36:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-11-15 22:36:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1394 transitions. [2019-11-15 22:36:41,495 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1394 transitions. Word has length 196 [2019-11-15 22:36:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:41,495 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1394 transitions. [2019-11-15 22:36:41,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1394 transitions. [2019-11-15 22:36:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 22:36:41,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:41,496 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:41,497 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:41,497 INFO L82 PathProgramCache]: Analyzing trace with hash -496931648, now seen corresponding path program 1 times [2019-11-15 22:36:41,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:41,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019464866] [2019-11-15 22:36:41,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:41,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:41,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-15 22:36:41,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019464866] [2019-11-15 22:36:41,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:41,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:41,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846914204] [2019-11-15 22:36:41,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:41,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:41,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:41,577 INFO L87 Difference]: Start difference. First operand 927 states and 1394 transitions. Second operand 4 states. [2019-11-15 22:36:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:41,869 INFO L93 Difference]: Finished difference Result 1960 states and 2948 transitions. [2019-11-15 22:36:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:41,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-15 22:36:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:41,872 INFO L225 Difference]: With dead ends: 1960 [2019-11-15 22:36:41,872 INFO L226 Difference]: Without dead ends: 1052 [2019-11-15 22:36:41,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-15 22:36:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 930. [2019-11-15 22:36:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-11-15 22:36:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1397 transitions. [2019-11-15 22:36:41,896 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1397 transitions. Word has length 197 [2019-11-15 22:36:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:41,896 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1397 transitions. [2019-11-15 22:36:41,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1397 transitions. [2019-11-15 22:36:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 22:36:41,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:41,897 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:41,898 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:41,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1361671742, now seen corresponding path program 1 times [2019-11-15 22:36:41,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:41,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031018497] [2019-11-15 22:36:41,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:41,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:41,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 22:36:41,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031018497] [2019-11-15 22:36:41,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:41,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:41,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971124637] [2019-11-15 22:36:41,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:41,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:41,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:41,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:41,986 INFO L87 Difference]: Start difference. First operand 930 states and 1397 transitions. Second operand 4 states. [2019-11-15 22:36:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:42,457 INFO L93 Difference]: Finished difference Result 2125 states and 3200 transitions. [2019-11-15 22:36:42,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:42,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-15 22:36:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:42,459 INFO L225 Difference]: With dead ends: 2125 [2019-11-15 22:36:42,459 INFO L226 Difference]: Without dead ends: 1214 [2019-11-15 22:36:42,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-11-15 22:36:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 966. [2019-11-15 22:36:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-11-15 22:36:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1448 transitions. [2019-11-15 22:36:42,483 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1448 transitions. Word has length 198 [2019-11-15 22:36:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:42,484 INFO L462 AbstractCegarLoop]: Abstraction has 966 states and 1448 transitions. [2019-11-15 22:36:42,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1448 transitions. [2019-11-15 22:36:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 22:36:42,485 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:42,485 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:42,486 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1284262237, now seen corresponding path program 1 times [2019-11-15 22:36:42,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:42,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269005938] [2019-11-15 22:36:42,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:42,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:42,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:42,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269005938] [2019-11-15 22:36:42,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:42,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:42,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435409128] [2019-11-15 22:36:42,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:42,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:42,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:42,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:42,572 INFO L87 Difference]: Start difference. First operand 966 states and 1448 transitions. Second operand 4 states. [2019-11-15 22:36:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:42,886 INFO L93 Difference]: Finished difference Result 2035 states and 3050 transitions. [2019-11-15 22:36:42,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:42,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-15 22:36:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:42,888 INFO L225 Difference]: With dead ends: 2035 [2019-11-15 22:36:42,889 INFO L226 Difference]: Without dead ends: 1088 [2019-11-15 22:36:42,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-11-15 22:36:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 966. [2019-11-15 22:36:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-11-15 22:36:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1445 transitions. [2019-11-15 22:36:42,918 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1445 transitions. Word has length 198 [2019-11-15 22:36:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:42,918 INFO L462 AbstractCegarLoop]: Abstraction has 966 states and 1445 transitions. [2019-11-15 22:36:42,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1445 transitions. [2019-11-15 22:36:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 22:36:42,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:42,920 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:42,920 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:42,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2141322173, now seen corresponding path program 1 times [2019-11-15 22:36:42,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:42,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035596810] [2019-11-15 22:36:42,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:42,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:42,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 22:36:42,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035596810] [2019-11-15 22:36:43,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:43,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:43,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485656429] [2019-11-15 22:36:43,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:43,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:43,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:43,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:43,001 INFO L87 Difference]: Start difference. First operand 966 states and 1445 transitions. Second operand 4 states. [2019-11-15 22:36:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:43,385 INFO L93 Difference]: Finished difference Result 2161 states and 3242 transitions. [2019-11-15 22:36:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:43,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-15 22:36:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:43,387 INFO L225 Difference]: With dead ends: 2161 [2019-11-15 22:36:43,387 INFO L226 Difference]: Without dead ends: 1214 [2019-11-15 22:36:43,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-11-15 22:36:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 969. [2019-11-15 22:36:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-11-15 22:36:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1448 transitions. [2019-11-15 22:36:43,440 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1448 transitions. Word has length 199 [2019-11-15 22:36:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:43,440 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1448 transitions. [2019-11-15 22:36:43,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1448 transitions. [2019-11-15 22:36:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 22:36:43,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:43,442 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:43,442 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:43,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2014210793, now seen corresponding path program 1 times [2019-11-15 22:36:43,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:43,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524793928] [2019-11-15 22:36:43,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:43,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:43,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:36:43,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524793928] [2019-11-15 22:36:43,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:43,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:43,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268469929] [2019-11-15 22:36:43,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:43,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:43,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:43,522 INFO L87 Difference]: Start difference. First operand 969 states and 1448 transitions. Second operand 4 states. [2019-11-15 22:36:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:43,895 INFO L93 Difference]: Finished difference Result 2164 states and 3242 transitions. [2019-11-15 22:36:43,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:43,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-15 22:36:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:43,899 INFO L225 Difference]: With dead ends: 2164 [2019-11-15 22:36:43,899 INFO L226 Difference]: Without dead ends: 1214 [2019-11-15 22:36:43,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-11-15 22:36:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 969. [2019-11-15 22:36:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-11-15 22:36:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1445 transitions. [2019-11-15 22:36:43,932 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1445 transitions. Word has length 199 [2019-11-15 22:36:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:43,933 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1445 transitions. [2019-11-15 22:36:43,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1445 transitions. [2019-11-15 22:36:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 22:36:43,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:43,935 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:43,936 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:43,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1486799318, now seen corresponding path program 1 times [2019-11-15 22:36:43,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:43,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430914641] [2019-11-15 22:36:43,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:43,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:43,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:44,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430914641] [2019-11-15 22:36:44,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:44,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:44,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378968929] [2019-11-15 22:36:44,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:44,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:44,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:44,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:44,028 INFO L87 Difference]: Start difference. First operand 969 states and 1445 transitions. Second operand 4 states. [2019-11-15 22:36:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:44,355 INFO L93 Difference]: Finished difference Result 2035 states and 3035 transitions. [2019-11-15 22:36:44,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:44,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-15 22:36:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:44,359 INFO L225 Difference]: With dead ends: 2035 [2019-11-15 22:36:44,359 INFO L226 Difference]: Without dead ends: 1085 [2019-11-15 22:36:44,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-11-15 22:36:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 969. [2019-11-15 22:36:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-11-15 22:36:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1442 transitions. [2019-11-15 22:36:44,393 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1442 transitions. Word has length 199 [2019-11-15 22:36:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:44,393 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1442 transitions. [2019-11-15 22:36:44,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1442 transitions. [2019-11-15 22:36:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 22:36:44,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:44,395 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:44,396 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:44,396 INFO L82 PathProgramCache]: Analyzing trace with hash 172785486, now seen corresponding path program 1 times [2019-11-15 22:36:44,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:44,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508812416] [2019-11-15 22:36:44,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:44,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:44,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:44,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508812416] [2019-11-15 22:36:44,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:44,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:44,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046788618] [2019-11-15 22:36:44,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:44,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:44,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:44,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:44,490 INFO L87 Difference]: Start difference. First operand 969 states and 1442 transitions. Second operand 4 states. [2019-11-15 22:36:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:44,820 INFO L93 Difference]: Finished difference Result 2026 states and 3017 transitions. [2019-11-15 22:36:44,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:44,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-15 22:36:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:44,822 INFO L225 Difference]: With dead ends: 2026 [2019-11-15 22:36:44,822 INFO L226 Difference]: Without dead ends: 1076 [2019-11-15 22:36:44,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-11-15 22:36:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 978. [2019-11-15 22:36:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-11-15 22:36:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1457 transitions. [2019-11-15 22:36:44,855 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1457 transitions. Word has length 199 [2019-11-15 22:36:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:44,856 INFO L462 AbstractCegarLoop]: Abstraction has 978 states and 1457 transitions. [2019-11-15 22:36:44,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1457 transitions. [2019-11-15 22:36:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 22:36:44,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:44,858 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:44,858 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash 18511907, now seen corresponding path program 1 times [2019-11-15 22:36:44,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:44,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722741308] [2019-11-15 22:36:44,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:44,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:44,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 22:36:44,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722741308] [2019-11-15 22:36:44,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:44,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:44,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992098022] [2019-11-15 22:36:44,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:44,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:44,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:44,951 INFO L87 Difference]: Start difference. First operand 978 states and 1457 transitions. Second operand 4 states. [2019-11-15 22:36:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:45,315 INFO L93 Difference]: Finished difference Result 2182 states and 3260 transitions. [2019-11-15 22:36:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:45,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-15 22:36:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:45,317 INFO L225 Difference]: With dead ends: 2182 [2019-11-15 22:36:45,317 INFO L226 Difference]: Without dead ends: 1223 [2019-11-15 22:36:45,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-11-15 22:36:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 981. [2019-11-15 22:36:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 22:36:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1460 transitions. [2019-11-15 22:36:45,350 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1460 transitions. Word has length 200 [2019-11-15 22:36:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:45,350 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1460 transitions. [2019-11-15 22:36:45,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1460 transitions. [2019-11-15 22:36:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 22:36:45,352 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:45,352 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-15 22:36:45,352 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1355840962, now seen corresponding path program 1 times [2019-11-15 22:36:45,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:45,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040349358] [2019-11-15 22:36:45,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:45,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:45,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 22:36:45,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040349358] [2019-11-15 22:36:45,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:45,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:45,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644828248] [2019-11-15 22:36:45,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:45,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:45,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:45,421 INFO L87 Difference]: Start difference. First operand 981 states and 1460 transitions. Second operand 4 states. [2019-11-15 22:36:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:45,802 INFO L93 Difference]: Finished difference Result 2185 states and 3260 transitions. [2019-11-15 22:36:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:45,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-15 22:36:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:45,804 INFO L225 Difference]: With dead ends: 2185 [2019-11-15 22:36:45,804 INFO L226 Difference]: Without dead ends: 1223 [2019-11-15 22:36:45,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-11-15 22:36:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 996. [2019-11-15 22:36:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-11-15 22:36:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1487 transitions. [2019-11-15 22:36:45,840 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1487 transitions. Word has length 200 [2019-11-15 22:36:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:45,840 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1487 transitions. [2019-11-15 22:36:45,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1487 transitions. [2019-11-15 22:36:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 22:36:45,842 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:45,843 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:45,843 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:45,843 INFO L82 PathProgramCache]: Analyzing trace with hash 580501642, now seen corresponding path program 1 times [2019-11-15 22:36:45,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:45,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243211972] [2019-11-15 22:36:45,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:45,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:45,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:36:45,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243211972] [2019-11-15 22:36:45,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:45,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:45,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779081436] [2019-11-15 22:36:45,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:45,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:45,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:45,980 INFO L87 Difference]: Start difference. First operand 996 states and 1487 transitions. Second operand 4 states. [2019-11-15 22:36:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:46,401 INFO L93 Difference]: Finished difference Result 2200 states and 3284 transitions. [2019-11-15 22:36:46,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:46,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-15 22:36:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:46,403 INFO L225 Difference]: With dead ends: 2200 [2019-11-15 22:36:46,403 INFO L226 Difference]: Without dead ends: 1223 [2019-11-15 22:36:46,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-11-15 22:36:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 996. [2019-11-15 22:36:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-11-15 22:36:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1484 transitions. [2019-11-15 22:36:46,427 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1484 transitions. Word has length 200 [2019-11-15 22:36:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:46,427 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1484 transitions. [2019-11-15 22:36:46,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1484 transitions. [2019-11-15 22:36:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:36:46,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:46,429 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:46,429 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1632354696, now seen corresponding path program 1 times [2019-11-15 22:36:46,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:46,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691845488] [2019-11-15 22:36:46,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 22:36:46,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691845488] [2019-11-15 22:36:46,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:46,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:46,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485442789] [2019-11-15 22:36:46,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:46,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:46,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:46,501 INFO L87 Difference]: Start difference. First operand 996 states and 1484 transitions. Second operand 4 states. [2019-11-15 22:36:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:46,921 INFO L93 Difference]: Finished difference Result 2170 states and 3242 transitions. [2019-11-15 22:36:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:46,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 22:36:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:46,923 INFO L225 Difference]: With dead ends: 2170 [2019-11-15 22:36:46,923 INFO L226 Difference]: Without dead ends: 1193 [2019-11-15 22:36:46,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-11-15 22:36:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 996. [2019-11-15 22:36:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-11-15 22:36:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1481 transitions. [2019-11-15 22:36:46,963 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1481 transitions. Word has length 201 [2019-11-15 22:36:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:46,964 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1481 transitions. [2019-11-15 22:36:46,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1481 transitions. [2019-11-15 22:36:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:36:46,966 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:46,966 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:46,966 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:46,967 INFO L82 PathProgramCache]: Analyzing trace with hash 778393602, now seen corresponding path program 1 times [2019-11-15 22:36:46,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:46,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213328647] [2019-11-15 22:36:46,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:46,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 22:36:47,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213328647] [2019-11-15 22:36:47,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:47,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:47,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90827304] [2019-11-15 22:36:47,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:47,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:47,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:47,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:47,049 INFO L87 Difference]: Start difference. First operand 996 states and 1481 transitions. Second operand 4 states. [2019-11-15 22:36:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:47,429 INFO L93 Difference]: Finished difference Result 2170 states and 3236 transitions. [2019-11-15 22:36:47,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:47,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 22:36:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:47,436 INFO L225 Difference]: With dead ends: 2170 [2019-11-15 22:36:47,436 INFO L226 Difference]: Without dead ends: 1193 [2019-11-15 22:36:47,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-11-15 22:36:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 999. [2019-11-15 22:36:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-11-15 22:36:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1484 transitions. [2019-11-15 22:36:47,475 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1484 transitions. Word has length 201 [2019-11-15 22:36:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:47,475 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 1484 transitions. [2019-11-15 22:36:47,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1484 transitions. [2019-11-15 22:36:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:36:47,477 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:47,477 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:47,478 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1504295748, now seen corresponding path program 1 times [2019-11-15 22:36:47,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:47,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496705681] [2019-11-15 22:36:47,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:47,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:47,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:36:47,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496705681] [2019-11-15 22:36:47,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:47,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:47,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943292977] [2019-11-15 22:36:47,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:47,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:47,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:47,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:47,565 INFO L87 Difference]: Start difference. First operand 999 states and 1484 transitions. Second operand 4 states. [2019-11-15 22:36:47,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:47,939 INFO L93 Difference]: Finished difference Result 2203 states and 3272 transitions. [2019-11-15 22:36:47,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:47,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 22:36:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:47,942 INFO L225 Difference]: With dead ends: 2203 [2019-11-15 22:36:47,942 INFO L226 Difference]: Without dead ends: 1223 [2019-11-15 22:36:47,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-11-15 22:36:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 999. [2019-11-15 22:36:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-11-15 22:36:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1481 transitions. [2019-11-15 22:36:47,983 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1481 transitions. Word has length 201 [2019-11-15 22:36:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:47,983 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 1481 transitions. [2019-11-15 22:36:47,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1481 transitions. [2019-11-15 22:36:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:36:47,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:47,986 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:36:47,986 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:47,986 INFO L82 PathProgramCache]: Analyzing trace with hash -166966693, now seen corresponding path program 1 times [2019-11-15 22:36:47,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:47,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041440490] [2019-11-15 22:36:47,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:47,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:47,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:36:48,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041440490] [2019-11-15 22:36:48,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:48,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:48,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131153503] [2019-11-15 22:36:48,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:48,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:48,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:48,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:48,092 INFO L87 Difference]: Start difference. First operand 999 states and 1481 transitions. Second operand 4 states. [2019-11-15 22:36:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:48,563 INFO L93 Difference]: Finished difference Result 2203 states and 3266 transitions. [2019-11-15 22:36:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:48,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 22:36:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:48,564 INFO L225 Difference]: With dead ends: 2203 [2019-11-15 22:36:48,564 INFO L226 Difference]: Without dead ends: 1223 [2019-11-15 22:36:48,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-11-15 22:36:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 999. [2019-11-15 22:36:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-11-15 22:36:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1478 transitions. [2019-11-15 22:36:48,597 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1478 transitions. Word has length 201 [2019-11-15 22:36:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:48,597 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 1478 transitions. [2019-11-15 22:36:48,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1478 transitions. [2019-11-15 22:36:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:36:48,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:48,599 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:48,599 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:48,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1953842574, now seen corresponding path program 1 times [2019-11-15 22:36:48,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:48,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446816791] [2019-11-15 22:36:48,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:48,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:48,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:48,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446816791] [2019-11-15 22:36:48,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:48,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:48,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807960890] [2019-11-15 22:36:48,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:48,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:48,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:48,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:48,725 INFO L87 Difference]: Start difference. First operand 999 states and 1478 transitions. Second operand 4 states. [2019-11-15 22:36:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:49,138 INFO L93 Difference]: Finished difference Result 2077 states and 3071 transitions. [2019-11-15 22:36:49,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:49,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 22:36:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:49,139 INFO L225 Difference]: With dead ends: 2077 [2019-11-15 22:36:49,139 INFO L226 Difference]: Without dead ends: 1097 [2019-11-15 22:36:49,140 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2019-11-15 22:36:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1002. [2019-11-15 22:36:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-11-15 22:36:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1481 transitions. [2019-11-15 22:36:49,180 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1481 transitions. Word has length 201 [2019-11-15 22:36:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:49,180 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1481 transitions. [2019-11-15 22:36:49,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1481 transitions. [2019-11-15 22:36:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 22:36:49,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:49,182 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:49,183 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:49,183 INFO L82 PathProgramCache]: Analyzing trace with hash 455085405, now seen corresponding path program 1 times [2019-11-15 22:36:49,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:49,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716704164] [2019-11-15 22:36:49,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:49,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:49,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 22:36:49,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716704164] [2019-11-15 22:36:49,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:49,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:49,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210055369] [2019-11-15 22:36:49,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:49,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:49,268 INFO L87 Difference]: Start difference. First operand 1002 states and 1481 transitions. Second operand 4 states. [2019-11-15 22:36:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:49,601 INFO L93 Difference]: Finished difference Result 2170 states and 3218 transitions. [2019-11-15 22:36:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:49,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-15 22:36:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:49,603 INFO L225 Difference]: With dead ends: 2170 [2019-11-15 22:36:49,603 INFO L226 Difference]: Without dead ends: 1187 [2019-11-15 22:36:49,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-11-15 22:36:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1005. [2019-11-15 22:36:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-11-15 22:36:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1484 transitions. [2019-11-15 22:36:49,638 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1484 transitions. Word has length 202 [2019-11-15 22:36:49,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:49,639 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 1484 transitions. [2019-11-15 22:36:49,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1484 transitions. [2019-11-15 22:36:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 22:36:49,641 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:49,641 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:49,642 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:49,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1669957647, now seen corresponding path program 1 times [2019-11-15 22:36:49,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:49,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128825769] [2019-11-15 22:36:49,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:49,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:49,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:36:49,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128825769] [2019-11-15 22:36:49,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:49,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:49,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875150726] [2019-11-15 22:36:49,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:49,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:49,734 INFO L87 Difference]: Start difference. First operand 1005 states and 1484 transitions. Second operand 4 states. [2019-11-15 22:36:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:50,108 INFO L93 Difference]: Finished difference Result 2182 states and 3230 transitions. [2019-11-15 22:36:50,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:50,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-15 22:36:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:50,110 INFO L225 Difference]: With dead ends: 2182 [2019-11-15 22:36:50,110 INFO L226 Difference]: Without dead ends: 1196 [2019-11-15 22:36:50,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-11-15 22:36:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1005. [2019-11-15 22:36:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-11-15 22:36:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1481 transitions. [2019-11-15 22:36:50,144 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1481 transitions. Word has length 202 [2019-11-15 22:36:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:50,144 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 1481 transitions. [2019-11-15 22:36:50,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1481 transitions. [2019-11-15 22:36:50,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 22:36:50,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:50,146 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:50,147 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:50,147 INFO L82 PathProgramCache]: Analyzing trace with hash 815996553, now seen corresponding path program 1 times [2019-11-15 22:36:50,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:50,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553767050] [2019-11-15 22:36:50,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:50,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:50,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:36:50,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553767050] [2019-11-15 22:36:50,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:50,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:50,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257061783] [2019-11-15 22:36:50,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:50,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:50,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:50,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:50,218 INFO L87 Difference]: Start difference. First operand 1005 states and 1481 transitions. Second operand 4 states. [2019-11-15 22:36:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:50,611 INFO L93 Difference]: Finished difference Result 2182 states and 3224 transitions. [2019-11-15 22:36:50,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:50,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-15 22:36:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:50,613 INFO L225 Difference]: With dead ends: 2182 [2019-11-15 22:36:50,614 INFO L226 Difference]: Without dead ends: 1196 [2019-11-15 22:36:50,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-11-15 22:36:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1005. [2019-11-15 22:36:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-11-15 22:36:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1478 transitions. [2019-11-15 22:36:50,663 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1478 transitions. Word has length 202 [2019-11-15 22:36:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:50,664 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 1478 transitions. [2019-11-15 22:36:50,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1478 transitions. [2019-11-15 22:36:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 22:36:50,666 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:50,666 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:50,666 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash 239598804, now seen corresponding path program 1 times [2019-11-15 22:36:50,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:50,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791725878] [2019-11-15 22:36:50,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:50,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:50,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:50,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791725878] [2019-11-15 22:36:50,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:50,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:50,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598628864] [2019-11-15 22:36:50,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:50,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:50,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:50,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:50,742 INFO L87 Difference]: Start difference. First operand 1005 states and 1478 transitions. Second operand 4 states. [2019-11-15 22:36:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:51,066 INFO L93 Difference]: Finished difference Result 2074 states and 3050 transitions. [2019-11-15 22:36:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:51,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-15 22:36:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:51,069 INFO L225 Difference]: With dead ends: 2074 [2019-11-15 22:36:51,069 INFO L226 Difference]: Without dead ends: 1088 [2019-11-15 22:36:51,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-11-15 22:36:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1008. [2019-11-15 22:36:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2019-11-15 22:36:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1481 transitions. [2019-11-15 22:36:51,116 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1481 transitions. Word has length 202 [2019-11-15 22:36:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:51,116 INFO L462 AbstractCegarLoop]: Abstraction has 1008 states and 1481 transitions. [2019-11-15 22:36:51,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1481 transitions. [2019-11-15 22:36:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 22:36:51,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:51,119 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:51,119 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:51,119 INFO L82 PathProgramCache]: Analyzing trace with hash -12834019, now seen corresponding path program 1 times [2019-11-15 22:36:51,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:51,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114434166] [2019-11-15 22:36:51,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:51,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:51,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:51,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114434166] [2019-11-15 22:36:51,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:51,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:51,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846728281] [2019-11-15 22:36:51,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:51,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:51,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:51,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:51,225 INFO L87 Difference]: Start difference. First operand 1008 states and 1481 transitions. Second operand 4 states. [2019-11-15 22:36:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:51,722 INFO L93 Difference]: Finished difference Result 2077 states and 3050 transitions. [2019-11-15 22:36:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:51,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-15 22:36:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:51,724 INFO L225 Difference]: With dead ends: 2077 [2019-11-15 22:36:51,725 INFO L226 Difference]: Without dead ends: 1088 [2019-11-15 22:36:51,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-11-15 22:36:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1011. [2019-11-15 22:36:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-11-15 22:36:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1484 transitions. [2019-11-15 22:36:51,772 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1484 transitions. Word has length 202 [2019-11-15 22:36:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:51,772 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 1484 transitions. [2019-11-15 22:36:51,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1484 transitions. [2019-11-15 22:36:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 22:36:51,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:51,775 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:51,775 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:51,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1620776886, now seen corresponding path program 1 times [2019-11-15 22:36:51,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:51,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977860378] [2019-11-15 22:36:51,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:51,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:51,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:36:51,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977860378] [2019-11-15 22:36:51,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:51,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:51,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755211926] [2019-11-15 22:36:51,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:51,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:51,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:51,858 INFO L87 Difference]: Start difference. First operand 1011 states and 1484 transitions. Second operand 4 states. [2019-11-15 22:36:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:52,283 INFO L93 Difference]: Finished difference Result 2185 states and 3218 transitions. [2019-11-15 22:36:52,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:52,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-11-15 22:36:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:52,284 INFO L225 Difference]: With dead ends: 2185 [2019-11-15 22:36:52,284 INFO L226 Difference]: Without dead ends: 1193 [2019-11-15 22:36:52,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-11-15 22:36:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 948. [2019-11-15 22:36:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-11-15 22:36:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1394 transitions. [2019-11-15 22:36:52,316 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1394 transitions. Word has length 203 [2019-11-15 22:36:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:52,316 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 1394 transitions. [2019-11-15 22:36:52,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1394 transitions. [2019-11-15 22:36:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 22:36:52,317 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:52,317 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:52,317 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2030196123, now seen corresponding path program 1 times [2019-11-15 22:36:52,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:52,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065778089] [2019-11-15 22:36:52,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:52,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:52,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:52,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065778089] [2019-11-15 22:36:52,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:52,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:52,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71856592] [2019-11-15 22:36:52,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:52,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:52,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:52,403 INFO L87 Difference]: Start difference. First operand 948 states and 1394 transitions. Second operand 4 states. [2019-11-15 22:36:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:52,690 INFO L93 Difference]: Finished difference Result 1948 states and 2864 transitions. [2019-11-15 22:36:52,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:52,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-11-15 22:36:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:52,691 INFO L225 Difference]: With dead ends: 1948 [2019-11-15 22:36:52,692 INFO L226 Difference]: Without dead ends: 1019 [2019-11-15 22:36:52,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-15 22:36:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 951. [2019-11-15 22:36:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-11-15 22:36:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1397 transitions. [2019-11-15 22:36:52,723 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1397 transitions. Word has length 203 [2019-11-15 22:36:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:52,723 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1397 transitions. [2019-11-15 22:36:52,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1397 transitions. [2019-11-15 22:36:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 22:36:52,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:52,725 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:52,725 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:52,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:52,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2069327042, now seen corresponding path program 1 times [2019-11-15 22:36:52,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:52,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143779420] [2019-11-15 22:36:52,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:52,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:52,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:52,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143779420] [2019-11-15 22:36:52,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:52,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:52,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803556270] [2019-11-15 22:36:52,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:52,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:52,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:52,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:52,801 INFO L87 Difference]: Start difference. First operand 951 states and 1397 transitions. Second operand 4 states. [2019-11-15 22:36:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:53,094 INFO L93 Difference]: Finished difference Result 1951 states and 2864 transitions. [2019-11-15 22:36:53,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:53,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-15 22:36:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:53,095 INFO L225 Difference]: With dead ends: 1951 [2019-11-15 22:36:53,096 INFO L226 Difference]: Without dead ends: 1019 [2019-11-15 22:36:53,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-15 22:36:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 954. [2019-11-15 22:36:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2019-11-15 22:36:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1400 transitions. [2019-11-15 22:36:53,127 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1400 transitions. Word has length 204 [2019-11-15 22:36:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:53,127 INFO L462 AbstractCegarLoop]: Abstraction has 954 states and 1400 transitions. [2019-11-15 22:36:53,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1400 transitions. [2019-11-15 22:36:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 22:36:53,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:53,129 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-15 22:36:53,129 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:53,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash 623274081, now seen corresponding path program 2 times [2019-11-15 22:36:53,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:53,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006353375] [2019-11-15 22:36:53,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:53,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:53,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-15 22:36:53,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006353375] [2019-11-15 22:36:53,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:53,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:53,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297291820] [2019-11-15 22:36:53,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:53,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:53,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:53,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:53,209 INFO L87 Difference]: Start difference. First operand 954 states and 1400 transitions. Second operand 4 states. [2019-11-15 22:36:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:53,614 INFO L93 Difference]: Finished difference Result 2134 states and 3137 transitions. [2019-11-15 22:36:53,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:53,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-11-15 22:36:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:53,616 INFO L225 Difference]: With dead ends: 2134 [2019-11-15 22:36:53,616 INFO L226 Difference]: Without dead ends: 1199 [2019-11-15 22:36:53,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-11-15 22:36:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1026. [2019-11-15 22:36:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-11-15 22:36:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1496 transitions. [2019-11-15 22:36:53,652 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1496 transitions. Word has length 205 [2019-11-15 22:36:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:53,652 INFO L462 AbstractCegarLoop]: Abstraction has 1026 states and 1496 transitions. [2019-11-15 22:36:53,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1496 transitions. [2019-11-15 22:36:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 22:36:53,654 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:53,654 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:53,654 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1092096096, now seen corresponding path program 1 times [2019-11-15 22:36:53,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:53,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389632717] [2019-11-15 22:36:53,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:53,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:53,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:53,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389632717] [2019-11-15 22:36:53,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:53,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:53,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814211363] [2019-11-15 22:36:53,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:53,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:53,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:53,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:53,719 INFO L87 Difference]: Start difference. First operand 1026 states and 1496 transitions. Second operand 4 states. [2019-11-15 22:36:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:54,003 INFO L93 Difference]: Finished difference Result 2092 states and 3050 transitions. [2019-11-15 22:36:54,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:54,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-11-15 22:36:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:54,005 INFO L225 Difference]: With dead ends: 2092 [2019-11-15 22:36:54,005 INFO L226 Difference]: Without dead ends: 1085 [2019-11-15 22:36:54,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-11-15 22:36:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1029. [2019-11-15 22:36:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-11-15 22:36:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1499 transitions. [2019-11-15 22:36:54,047 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1499 transitions. Word has length 205 [2019-11-15 22:36:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:54,048 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 1499 transitions. [2019-11-15 22:36:54,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1499 transitions. [2019-11-15 22:36:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-15 22:36:54,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:54,050 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-15 22:36:54,051 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1893497092, now seen corresponding path program 1 times [2019-11-15 22:36:54,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:54,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376670202] [2019-11-15 22:36:54,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:54,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:54,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-15 22:36:54,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376670202] [2019-11-15 22:36:54,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:54,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:54,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817858010] [2019-11-15 22:36:54,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:54,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:54,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:54,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:54,149 INFO L87 Difference]: Start difference. First operand 1029 states and 1499 transitions. Second operand 4 states. [2019-11-15 22:36:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:54,516 INFO L93 Difference]: Finished difference Result 2200 states and 3221 transitions. [2019-11-15 22:36:54,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:54,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-15 22:36:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:54,517 INFO L225 Difference]: With dead ends: 2200 [2019-11-15 22:36:54,517 INFO L226 Difference]: Without dead ends: 1190 [2019-11-15 22:36:54,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-11-15 22:36:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1032. [2019-11-15 22:36:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-11-15 22:36:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1502 transitions. [2019-11-15 22:36:54,550 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1502 transitions. Word has length 206 [2019-11-15 22:36:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:54,550 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1502 transitions. [2019-11-15 22:36:54,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1502 transitions. [2019-11-15 22:36:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-15 22:36:54,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:54,551 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-15 22:36:54,551 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1367370904, now seen corresponding path program 2 times [2019-11-15 22:36:54,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:54,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653044541] [2019-11-15 22:36:54,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:54,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:54,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-15 22:36:54,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653044541] [2019-11-15 22:36:54,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:54,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:54,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059748410] [2019-11-15 22:36:54,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:54,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:54,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:54,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:54,624 INFO L87 Difference]: Start difference. First operand 1032 states and 1502 transitions. Second operand 4 states. [2019-11-15 22:36:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:55,007 INFO L93 Difference]: Finished difference Result 2221 states and 3248 transitions. [2019-11-15 22:36:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:55,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-15 22:36:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:55,009 INFO L225 Difference]: With dead ends: 2221 [2019-11-15 22:36:55,009 INFO L226 Difference]: Without dead ends: 1208 [2019-11-15 22:36:55,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2019-11-15 22:36:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1035. [2019-11-15 22:36:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-11-15 22:36:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1505 transitions. [2019-11-15 22:36:55,043 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1505 transitions. Word has length 206 [2019-11-15 22:36:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:55,044 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1505 transitions. [2019-11-15 22:36:55,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1505 transitions. [2019-11-15 22:36:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-15 22:36:55,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:55,045 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:36:55,045 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:55,046 INFO L82 PathProgramCache]: Analyzing trace with hash 821017813, now seen corresponding path program 1 times [2019-11-15 22:36:55,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:55,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133858158] [2019-11-15 22:36:55,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:55,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:55,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-15 22:36:55,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133858158] [2019-11-15 22:36:55,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:55,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:55,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085421561] [2019-11-15 22:36:55,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:55,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:55,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:55,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:55,116 INFO L87 Difference]: Start difference. First operand 1035 states and 1505 transitions. Second operand 4 states. [2019-11-15 22:36:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:55,463 INFO L93 Difference]: Finished difference Result 2212 states and 3233 transitions. [2019-11-15 22:36:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:55,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-15 22:36:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:55,465 INFO L225 Difference]: With dead ends: 2212 [2019-11-15 22:36:55,465 INFO L226 Difference]: Without dead ends: 1196 [2019-11-15 22:36:55,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-11-15 22:36:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 963. [2019-11-15 22:36:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-15 22:36:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1409 transitions. [2019-11-15 22:36:55,510 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1409 transitions. Word has length 207 [2019-11-15 22:36:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:55,511 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1409 transitions. [2019-11-15 22:36:55,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1409 transitions. [2019-11-15 22:36:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-15 22:36:55,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:55,512 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:55,512 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:55,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:55,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1524612265, now seen corresponding path program 1 times [2019-11-15 22:36:55,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:55,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150127913] [2019-11-15 22:36:55,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:55,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:55,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:55,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150127913] [2019-11-15 22:36:55,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:55,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:55,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511698919] [2019-11-15 22:36:55,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:55,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:55,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:55,602 INFO L87 Difference]: Start difference. First operand 963 states and 1409 transitions. Second operand 4 states. [2019-11-15 22:36:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:55,891 INFO L93 Difference]: Finished difference Result 1963 states and 2870 transitions. [2019-11-15 22:36:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:55,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-15 22:36:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:55,892 INFO L225 Difference]: With dead ends: 1963 [2019-11-15 22:36:55,892 INFO L226 Difference]: Without dead ends: 1019 [2019-11-15 22:36:55,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-15 22:36:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 966. [2019-11-15 22:36:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-11-15 22:36:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1412 transitions. [2019-11-15 22:36:55,926 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1412 transitions. Word has length 208 [2019-11-15 22:36:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:55,926 INFO L462 AbstractCegarLoop]: Abstraction has 966 states and 1412 transitions. [2019-11-15 22:36:55,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1412 transitions. [2019-11-15 22:36:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-15 22:36:55,928 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:55,928 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:55,928 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2042175818, now seen corresponding path program 1 times [2019-11-15 22:36:55,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:55,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365097852] [2019-11-15 22:36:55,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:55,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:55,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-15 22:36:55,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365097852] [2019-11-15 22:36:55,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:55,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:55,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395029364] [2019-11-15 22:36:55,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:55,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:55,990 INFO L87 Difference]: Start difference. First operand 966 states and 1412 transitions. Second operand 4 states. [2019-11-15 22:36:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:56,344 INFO L93 Difference]: Finished difference Result 2146 states and 3140 transitions. [2019-11-15 22:36:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:56,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-15 22:36:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:56,346 INFO L225 Difference]: With dead ends: 2146 [2019-11-15 22:36:56,346 INFO L226 Difference]: Without dead ends: 1199 [2019-11-15 22:36:56,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:56,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-11-15 22:36:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1050. [2019-11-15 22:36:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-11-15 22:36:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1526 transitions. [2019-11-15 22:36:56,382 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1526 transitions. Word has length 209 [2019-11-15 22:36:56,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:56,383 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 1526 transitions. [2019-11-15 22:36:56,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1526 transitions. [2019-11-15 22:36:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-15 22:36:56,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:56,385 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:56,385 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash 484366823, now seen corresponding path program 1 times [2019-11-15 22:36:56,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:56,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176711273] [2019-11-15 22:36:56,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:56,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:56,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:36:56,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176711273] [2019-11-15 22:36:56,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:56,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:56,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689283221] [2019-11-15 22:36:56,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:56,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:56,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:56,464 INFO L87 Difference]: Start difference. First operand 1050 states and 1526 transitions. Second operand 4 states. [2019-11-15 22:36:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:56,752 INFO L93 Difference]: Finished difference Result 2125 states and 3086 transitions. [2019-11-15 22:36:56,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:56,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-15 22:36:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:56,753 INFO L225 Difference]: With dead ends: 2125 [2019-11-15 22:36:56,753 INFO L226 Difference]: Without dead ends: 1094 [2019-11-15 22:36:56,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-11-15 22:36:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1053. [2019-11-15 22:36:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-11-15 22:36:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1529 transitions. [2019-11-15 22:36:56,800 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1529 transitions. Word has length 209 [2019-11-15 22:36:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:56,800 INFO L462 AbstractCegarLoop]: Abstraction has 1053 states and 1529 transitions. [2019-11-15 22:36:56,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1529 transitions. [2019-11-15 22:36:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-15 22:36:56,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:56,802 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:56,802 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash -944781679, now seen corresponding path program 1 times [2019-11-15 22:36:56,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:56,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196456449] [2019-11-15 22:36:56,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:56,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:56,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-15 22:36:56,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196456449] [2019-11-15 22:36:56,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:56,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:56,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847062763] [2019-11-15 22:36:56,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:56,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:56,901 INFO L87 Difference]: Start difference. First operand 1053 states and 1529 transitions. Second operand 4 states. [2019-11-15 22:36:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:57,251 INFO L93 Difference]: Finished difference Result 2212 states and 3218 transitions. [2019-11-15 22:36:57,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:57,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-15 22:36:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:57,252 INFO L225 Difference]: With dead ends: 2212 [2019-11-15 22:36:57,252 INFO L226 Difference]: Without dead ends: 1178 [2019-11-15 22:36:57,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-15 22:36:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1056. [2019-11-15 22:36:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-11-15 22:36:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1532 transitions. [2019-11-15 22:36:57,290 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1532 transitions. Word has length 210 [2019-11-15 22:36:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:57,290 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 1532 transitions. [2019-11-15 22:36:57,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1532 transitions. [2019-11-15 22:36:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-15 22:36:57,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:57,292 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:57,292 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:57,292 INFO L82 PathProgramCache]: Analyzing trace with hash 427109949, now seen corresponding path program 1 times [2019-11-15 22:36:57,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:57,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483489429] [2019-11-15 22:36:57,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:57,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:57,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-15 22:36:57,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483489429] [2019-11-15 22:36:57,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:57,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:57,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573710903] [2019-11-15 22:36:57,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:57,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:57,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:57,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:57,354 INFO L87 Difference]: Start difference. First operand 1056 states and 1532 transitions. Second operand 4 states. [2019-11-15 22:36:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:57,710 INFO L93 Difference]: Finished difference Result 2251 states and 3281 transitions. [2019-11-15 22:36:57,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:57,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-15 22:36:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:57,711 INFO L225 Difference]: With dead ends: 2251 [2019-11-15 22:36:57,712 INFO L226 Difference]: Without dead ends: 1214 [2019-11-15 22:36:57,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-11-15 22:36:57,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1065. [2019-11-15 22:36:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-11-15 22:36:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1547 transitions. [2019-11-15 22:36:57,750 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1547 transitions. Word has length 210 [2019-11-15 22:36:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:57,751 INFO L462 AbstractCegarLoop]: Abstraction has 1065 states and 1547 transitions. [2019-11-15 22:36:57,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1547 transitions. [2019-11-15 22:36:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-15 22:36:57,752 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:57,753 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:57,753 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:57,753 INFO L82 PathProgramCache]: Analyzing trace with hash 285813164, now seen corresponding path program 1 times [2019-11-15 22:36:57,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:57,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566716784] [2019-11-15 22:36:57,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:57,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:57,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 22:36:57,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566716784] [2019-11-15 22:36:57,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:57,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:57,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226736729] [2019-11-15 22:36:57,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:57,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:57,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:57,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:57,825 INFO L87 Difference]: Start difference. First operand 1065 states and 1547 transitions. Second operand 4 states. [2019-11-15 22:36:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:58,169 INFO L93 Difference]: Finished difference Result 2233 states and 3248 transitions. [2019-11-15 22:36:58,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:58,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-15 22:36:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:58,170 INFO L225 Difference]: With dead ends: 2233 [2019-11-15 22:36:58,170 INFO L226 Difference]: Without dead ends: 1187 [2019-11-15 22:36:58,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-11-15 22:36:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1065. [2019-11-15 22:36:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-11-15 22:36:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1544 transitions. [2019-11-15 22:36:58,227 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1544 transitions. Word has length 211 [2019-11-15 22:36:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:58,228 INFO L462 AbstractCegarLoop]: Abstraction has 1065 states and 1544 transitions. [2019-11-15 22:36:58,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1544 transitions. [2019-11-15 22:36:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-15 22:36:58,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:58,230 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:58,230 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:58,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1706334230, now seen corresponding path program 1 times [2019-11-15 22:36:58,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:58,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10538360] [2019-11-15 22:36:58,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:58,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:58,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-15 22:36:58,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10538360] [2019-11-15 22:36:58,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:58,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:58,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664623272] [2019-11-15 22:36:58,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:58,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:58,301 INFO L87 Difference]: Start difference. First operand 1065 states and 1544 transitions. Second operand 4 states. [2019-11-15 22:36:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:58,697 INFO L93 Difference]: Finished difference Result 2236 states and 3248 transitions. [2019-11-15 22:36:58,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:58,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-15 22:36:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:58,698 INFO L225 Difference]: With dead ends: 2236 [2019-11-15 22:36:58,698 INFO L226 Difference]: Without dead ends: 1190 [2019-11-15 22:36:58,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-11-15 22:36:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1059. [2019-11-15 22:36:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-11-15 22:36:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1535 transitions. [2019-11-15 22:36:58,739 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1535 transitions. Word has length 211 [2019-11-15 22:36:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:58,739 INFO L462 AbstractCegarLoop]: Abstraction has 1059 states and 1535 transitions. [2019-11-15 22:36:58,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1535 transitions. [2019-11-15 22:36:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-15 22:36:58,741 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:58,741 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:58,741 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:58,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash 599649127, now seen corresponding path program 1 times [2019-11-15 22:36:58,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:58,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752653730] [2019-11-15 22:36:58,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:58,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:58,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-15 22:36:58,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752653730] [2019-11-15 22:36:58,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:58,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:58,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772461460] [2019-11-15 22:36:58,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:58,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:58,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:58,826 INFO L87 Difference]: Start difference. First operand 1059 states and 1535 transitions. Second operand 4 states. [2019-11-15 22:36:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:59,165 INFO L93 Difference]: Finished difference Result 2224 states and 3227 transitions. [2019-11-15 22:36:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:59,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-15 22:36:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:59,167 INFO L225 Difference]: With dead ends: 2224 [2019-11-15 22:36:59,167 INFO L226 Difference]: Without dead ends: 1184 [2019-11-15 22:36:59,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-15 22:36:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1062. [2019-11-15 22:36:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-11-15 22:36:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1538 transitions. [2019-11-15 22:36:59,207 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1538 transitions. Word has length 212 [2019-11-15 22:36:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:59,208 INFO L462 AbstractCegarLoop]: Abstraction has 1062 states and 1538 transitions. [2019-11-15 22:36:59,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1538 transitions. [2019-11-15 22:36:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-15 22:36:59,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:59,209 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:59,210 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:59,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:59,210 INFO L82 PathProgramCache]: Analyzing trace with hash -714364705, now seen corresponding path program 1 times [2019-11-15 22:36:59,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:59,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782742299] [2019-11-15 22:36:59,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:59,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:59,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 22:36:59,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782742299] [2019-11-15 22:36:59,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:59,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:59,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062946968] [2019-11-15 22:36:59,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:59,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:59,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:59,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:59,266 INFO L87 Difference]: Start difference. First operand 1062 states and 1538 transitions. Second operand 4 states. [2019-11-15 22:36:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:59,562 INFO L93 Difference]: Finished difference Result 2146 states and 3104 transitions. [2019-11-15 22:36:59,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:59,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-15 22:36:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:59,564 INFO L225 Difference]: With dead ends: 2146 [2019-11-15 22:36:59,564 INFO L226 Difference]: Without dead ends: 1103 [2019-11-15 22:36:59,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:36:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-11-15 22:36:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1062. [2019-11-15 22:36:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-11-15 22:36:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1535 transitions. [2019-11-15 22:36:59,621 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1535 transitions. Word has length 212 [2019-11-15 22:36:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:59,621 INFO L462 AbstractCegarLoop]: Abstraction has 1062 states and 1535 transitions. [2019-11-15 22:36:59,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1535 transitions. [2019-11-15 22:36:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-15 22:36:59,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:59,623 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:59,623 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1847479437, now seen corresponding path program 1 times [2019-11-15 22:36:59,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:59,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922644228] [2019-11-15 22:36:59,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:59,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:59,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:36:59,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922644228] [2019-11-15 22:36:59,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:59,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:59,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297632924] [2019-11-15 22:36:59,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:59,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:59,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:59,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:59,683 INFO L87 Difference]: Start difference. First operand 1062 states and 1535 transitions. Second operand 4 states. [2019-11-15 22:37:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:00,050 INFO L93 Difference]: Finished difference Result 2233 states and 3230 transitions. [2019-11-15 22:37:00,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:00,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-15 22:37:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:00,052 INFO L225 Difference]: With dead ends: 2233 [2019-11-15 22:37:00,052 INFO L226 Difference]: Without dead ends: 1190 [2019-11-15 22:37:00,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-11-15 22:37:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1062. [2019-11-15 22:37:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-11-15 22:37:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1532 transitions. [2019-11-15 22:37:00,097 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1532 transitions. Word has length 212 [2019-11-15 22:37:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:00,097 INFO L462 AbstractCegarLoop]: Abstraction has 1062 states and 1532 transitions. [2019-11-15 22:37:00,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1532 transitions. [2019-11-15 22:37:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-15 22:37:00,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:00,099 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:00,100 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1093697720, now seen corresponding path program 1 times [2019-11-15 22:37:00,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:00,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508708219] [2019-11-15 22:37:00,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:00,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:00,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 22:37:00,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508708219] [2019-11-15 22:37:00,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:00,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:00,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021392071] [2019-11-15 22:37:00,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:00,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:00,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:00,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:00,181 INFO L87 Difference]: Start difference. First operand 1062 states and 1532 transitions. Second operand 4 states. [2019-11-15 22:37:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:00,479 INFO L93 Difference]: Finished difference Result 2140 states and 3086 transitions. [2019-11-15 22:37:00,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:00,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-15 22:37:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:00,481 INFO L225 Difference]: With dead ends: 2140 [2019-11-15 22:37:00,481 INFO L226 Difference]: Without dead ends: 1097 [2019-11-15 22:37:00,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2019-11-15 22:37:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1062. [2019-11-15 22:37:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-11-15 22:37:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1529 transitions. [2019-11-15 22:37:00,523 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1529 transitions. Word has length 213 [2019-11-15 22:37:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:00,523 INFO L462 AbstractCegarLoop]: Abstraction has 1062 states and 1529 transitions. [2019-11-15 22:37:00,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1529 transitions. [2019-11-15 22:37:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-15 22:37:00,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:00,526 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:00,526 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:00,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1107912064, now seen corresponding path program 1 times [2019-11-15 22:37:00,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:00,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925419785] [2019-11-15 22:37:00,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:00,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:00,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:37:00,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925419785] [2019-11-15 22:37:00,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:00,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:00,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657611042] [2019-11-15 22:37:00,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:00,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:00,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:00,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:00,605 INFO L87 Difference]: Start difference. First operand 1062 states and 1529 transitions. Second operand 4 states. [2019-11-15 22:37:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:00,938 INFO L93 Difference]: Finished difference Result 2227 states and 3209 transitions. [2019-11-15 22:37:00,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:00,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-15 22:37:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:00,939 INFO L225 Difference]: With dead ends: 2227 [2019-11-15 22:37:00,939 INFO L226 Difference]: Without dead ends: 1184 [2019-11-15 22:37:00,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-15 22:37:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 981. [2019-11-15 22:37:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-15 22:37:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1421 transitions. [2019-11-15 22:37:00,981 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1421 transitions. Word has length 213 [2019-11-15 22:37:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:00,981 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1421 transitions. [2019-11-15 22:37:00,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1421 transitions. [2019-11-15 22:37:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-15 22:37:00,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:00,983 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:00,983 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:00,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1873041400, now seen corresponding path program 1 times [2019-11-15 22:37:00,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:00,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239109741] [2019-11-15 22:37:00,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:00,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:00,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:37:01,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239109741] [2019-11-15 22:37:01,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:01,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:01,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338896087] [2019-11-15 22:37:01,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:01,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:01,082 INFO L87 Difference]: Start difference. First operand 981 states and 1421 transitions. Second operand 4 states. [2019-11-15 22:37:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:01,573 INFO L93 Difference]: Finished difference Result 2137 states and 3086 transitions. [2019-11-15 22:37:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:01,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-15 22:37:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:01,575 INFO L225 Difference]: With dead ends: 2137 [2019-11-15 22:37:01,575 INFO L226 Difference]: Without dead ends: 1175 [2019-11-15 22:37:01,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-11-15 22:37:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1077. [2019-11-15 22:37:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2019-11-15 22:37:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1547 transitions. [2019-11-15 22:37:01,622 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1547 transitions. Word has length 213 [2019-11-15 22:37:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:01,622 INFO L462 AbstractCegarLoop]: Abstraction has 1077 states and 1547 transitions. [2019-11-15 22:37:01,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1547 transitions. [2019-11-15 22:37:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-15 22:37:01,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:01,624 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:37:01,624 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:01,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388444, now seen corresponding path program 1 times [2019-11-15 22:37:01,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:01,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374005374] [2019-11-15 22:37:01,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:01,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:01,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 138 proven. 18 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-11-15 22:37:01,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374005374] [2019-11-15 22:37:01,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137992785] [2019-11-15 22:37:01,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:01,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:37:01,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:02,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 22:37:02,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:02,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:02,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:02,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 22:37:02,071 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 22:37:02,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:37:02,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:02,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:02,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:02,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 22:37:02,115 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:37:02,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:37:02,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:02,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:02,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:02,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 22:37:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 138 proven. 18 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-11-15 22:37:02,203 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:02,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 22:37:02,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646273801] [2019-11-15 22:37:02,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:37:02,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:02,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:37:02,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:02,208 INFO L87 Difference]: Start difference. First operand 1077 states and 1547 transitions. Second operand 9 states. [2019-11-15 22:37:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:03,804 INFO L93 Difference]: Finished difference Result 2638 states and 3846 transitions. [2019-11-15 22:37:03,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:37:03,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 213 [2019-11-15 22:37:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:03,812 INFO L225 Difference]: With dead ends: 2638 [2019-11-15 22:37:03,812 INFO L226 Difference]: Without dead ends: 1580 [2019-11-15 22:37:03,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:37:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-11-15 22:37:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1251. [2019-11-15 22:37:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2019-11-15 22:37:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1865 transitions. [2019-11-15 22:37:03,905 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1865 transitions. Word has length 213 [2019-11-15 22:37:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:03,906 INFO L462 AbstractCegarLoop]: Abstraction has 1251 states and 1865 transitions. [2019-11-15 22:37:03,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:37:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1865 transitions. [2019-11-15 22:37:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 22:37:03,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:03,910 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:37:04,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:04,122 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1734651336, now seen corresponding path program 1 times [2019-11-15 22:37:04,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:04,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575308324] [2019-11-15 22:37:04,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:04,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:04,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-15 22:37:04,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575308324] [2019-11-15 22:37:04,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:04,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:04,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412942028] [2019-11-15 22:37:04,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:04,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:04,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:04,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:04,257 INFO L87 Difference]: Start difference. First operand 1251 states and 1865 transitions. Second operand 4 states. [2019-11-15 22:37:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:04,726 INFO L93 Difference]: Finished difference Result 2618 states and 3902 transitions. [2019-11-15 22:37:04,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:04,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-11-15 22:37:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:04,732 INFO L225 Difference]: With dead ends: 2618 [2019-11-15 22:37:04,732 INFO L226 Difference]: Without dead ends: 1386 [2019-11-15 22:37:04,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-11-15 22:37:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1275. [2019-11-15 22:37:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-11-15 22:37:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1907 transitions. [2019-11-15 22:37:04,808 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1907 transitions. Word has length 217 [2019-11-15 22:37:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:04,808 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1907 transitions. [2019-11-15 22:37:04,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1907 transitions. [2019-11-15 22:37:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-15 22:37:04,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:04,811 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:37:04,811 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash -416366930, now seen corresponding path program 1 times [2019-11-15 22:37:04,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:04,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560644954] [2019-11-15 22:37:04,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:04,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:04,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-11-15 22:37:04,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560644954] [2019-11-15 22:37:04,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:04,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:04,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459358603] [2019-11-15 22:37:04,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:04,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:04,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:04,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:04,917 INFO L87 Difference]: Start difference. First operand 1275 states and 1907 transitions. Second operand 4 states. [2019-11-15 22:37:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:05,228 INFO L93 Difference]: Finished difference Result 2564 states and 3837 transitions. [2019-11-15 22:37:05,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:05,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-11-15 22:37:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:05,231 INFO L225 Difference]: With dead ends: 2564 [2019-11-15 22:37:05,232 INFO L226 Difference]: Without dead ends: 1308 [2019-11-15 22:37:05,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-15 22:37:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1284. [2019-11-15 22:37:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-11-15 22:37:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1922 transitions. [2019-11-15 22:37:05,303 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1922 transitions. Word has length 219 [2019-11-15 22:37:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:05,303 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 1922 transitions. [2019-11-15 22:37:05,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1922 transitions. [2019-11-15 22:37:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-15 22:37:05,305 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:05,306 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 22:37:05,306 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:05,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1335119462, now seen corresponding path program 1 times [2019-11-15 22:37:05,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:05,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956233731] [2019-11-15 22:37:05,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:05,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:05,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-15 22:37:05,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956233731] [2019-11-15 22:37:05,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027445257] [2019-11-15 22:37:05,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:05,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:37:05,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:05,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-11-15 22:37:05,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 16 [2019-11-15 22:37:05,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:37:05,776 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 22:37:05,776 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:05,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:05,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:05,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 22:37:05,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:37:05,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:05,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:05,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:05,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 22:37:05,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-15 22:37:05,819 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 22:37:05,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 22:37:05,820 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:05,835 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 22:37:05,835 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:05,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:05,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:05,841 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 22:37:05,868 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:37:05,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:37:05,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:05,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:05,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:05,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 22:37:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 247 proven. 11 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 22:37:05,939 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:05,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 22:37:05,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985542470] [2019-11-15 22:37:05,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:37:05,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:05,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:37:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:05,941 INFO L87 Difference]: Start difference. First operand 1284 states and 1922 transitions. Second operand 9 states. [2019-11-15 22:37:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:06,924 INFO L93 Difference]: Finished difference Result 2906 states and 4351 transitions. [2019-11-15 22:37:06,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:37:06,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 220 [2019-11-15 22:37:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:06,934 INFO L225 Difference]: With dead ends: 2906 [2019-11-15 22:37:06,934 INFO L226 Difference]: Without dead ends: 1641 [2019-11-15 22:37:06,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 217 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:37:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-11-15 22:37:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1371. [2019-11-15 22:37:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2019-11-15 22:37:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2072 transitions. [2019-11-15 22:37:07,020 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2072 transitions. Word has length 220 [2019-11-15 22:37:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:07,020 INFO L462 AbstractCegarLoop]: Abstraction has 1371 states and 2072 transitions. [2019-11-15 22:37:07,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:37:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2072 transitions. [2019-11-15 22:37:07,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-15 22:37:07,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:07,023 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:07,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:07,227 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:07,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:07,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1658860456, now seen corresponding path program 1 times [2019-11-15 22:37:07,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:07,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998895053] [2019-11-15 22:37:07,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:07,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:07,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 238 proven. 62 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-15 22:37:07,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998895053] [2019-11-15 22:37:07,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670909273] [2019-11-15 22:37:07,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:07,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:37:07,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:07,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-11-15 22:37:07,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 16 [2019-11-15 22:37:07,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:37:07,687 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 22:37:07,687 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:07,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:07,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:07,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 22:37:07,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:37:07,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:07,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:07,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:07,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 22:37:07,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-15 22:37:07,727 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 22:37:07,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 22:37:07,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:07,739 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 22:37:07,740 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:07,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:07,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:07,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 22:37:07,769 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:37:07,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:37:07,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:07,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:07,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:07,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 22:37:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 232 proven. 16 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 22:37:07,831 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:07,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 22:37:07,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330531625] [2019-11-15 22:37:07,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:37:07,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:37:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:07,833 INFO L87 Difference]: Start difference. First operand 1371 states and 2072 transitions. Second operand 9 states. [2019-11-15 22:37:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:08,818 INFO L93 Difference]: Finished difference Result 2945 states and 4423 transitions. [2019-11-15 22:37:08,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:37:08,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 221 [2019-11-15 22:37:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:08,824 INFO L225 Difference]: With dead ends: 2945 [2019-11-15 22:37:08,825 INFO L226 Difference]: Without dead ends: 1593 [2019-11-15 22:37:08,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 218 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:37:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2019-11-15 22:37:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1371. [2019-11-15 22:37:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2019-11-15 22:37:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2060 transitions. [2019-11-15 22:37:08,911 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2060 transitions. Word has length 221 [2019-11-15 22:37:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:08,911 INFO L462 AbstractCegarLoop]: Abstraction has 1371 states and 2060 transitions. [2019-11-15 22:37:08,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:37:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2060 transitions. [2019-11-15 22:37:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-15 22:37:08,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:08,914 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:09,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:09,126 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1531874337, now seen corresponding path program 1 times [2019-11-15 22:37:09,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:09,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985803382] [2019-11-15 22:37:09,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:09,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:09,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 240 proven. 64 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-15 22:37:09,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985803382] [2019-11-15 22:37:09,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342144610] [2019-11-15 22:37:09,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:09,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:37:09,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:09,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-11-15 22:37:09,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 16 [2019-11-15 22:37:09,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:37:09,580 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 22:37:09,581 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:09,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:09,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:09,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 22:37:09,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:37:09,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:09,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:09,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:09,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 22:37:09,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-15 22:37:09,623 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 22:37:09,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 22:37:09,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:09,636 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 22:37:09,636 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:09,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:09,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:09,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 22:37:09,674 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:37:09,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:37:09,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:09,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:09,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:09,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 22:37:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 235 proven. 15 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 22:37:09,736 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:09,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 22:37:09,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437662361] [2019-11-15 22:37:09,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:37:09,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:37:09,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:09,738 INFO L87 Difference]: Start difference. First operand 1371 states and 2060 transitions. Second operand 9 states. [2019-11-15 22:37:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:10,787 INFO L93 Difference]: Finished difference Result 3056 states and 4585 transitions. [2019-11-15 22:37:10,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:37:10,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2019-11-15 22:37:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:10,788 INFO L225 Difference]: With dead ends: 3056 [2019-11-15 22:37:10,788 INFO L226 Difference]: Without dead ends: 1704 [2019-11-15 22:37:10,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:37:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-11-15 22:37:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1455. [2019-11-15 22:37:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-11-15 22:37:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2192 transitions. [2019-11-15 22:37:10,843 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2192 transitions. Word has length 222 [2019-11-15 22:37:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:10,843 INFO L462 AbstractCegarLoop]: Abstraction has 1455 states and 2192 transitions. [2019-11-15 22:37:10,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:37:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2192 transitions. [2019-11-15 22:37:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-15 22:37:10,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:10,844 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:11,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:11,048 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2066906502, now seen corresponding path program 1 times [2019-11-15 22:37:11,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:11,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457719557] [2019-11-15 22:37:11,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:11,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:11,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 242 proven. 66 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:37:11,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457719557] [2019-11-15 22:37:11,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288879159] [2019-11-15 22:37:11,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:11,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:37:11,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:11,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-11-15 22:37:11,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 16 [2019-11-15 22:37:11,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:37:11,464 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 22:37:11,465 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:11,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:11,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:11,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 22:37:11,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:37:11,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:11,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:11,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:11,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 22:37:11,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-15 22:37:11,511 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 22:37:11,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 22:37:11,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:11,527 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 22:37:11,527 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:11,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:11,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:11,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 22:37:11,553 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:37:11,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:37:11,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:11,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:11,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:11,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 22:37:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 238 proven. 14 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-15 22:37:11,614 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:11,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 22:37:11,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760343764] [2019-11-15 22:37:11,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:37:11,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:11,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:37:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:11,616 INFO L87 Difference]: Start difference. First operand 1455 states and 2192 transitions. Second operand 9 states. [2019-11-15 22:37:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:12,502 INFO L93 Difference]: Finished difference Result 3116 states and 4666 transitions. [2019-11-15 22:37:12,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:37:12,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 223 [2019-11-15 22:37:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:12,504 INFO L225 Difference]: With dead ends: 3116 [2019-11-15 22:37:12,504 INFO L226 Difference]: Without dead ends: 1680 [2019-11-15 22:37:12,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:37:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2019-11-15 22:37:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1443. [2019-11-15 22:37:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-11-15 22:37:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2168 transitions. [2019-11-15 22:37:12,584 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2168 transitions. Word has length 223 [2019-11-15 22:37:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:12,585 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 2168 transitions. [2019-11-15 22:37:12,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:37:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2168 transitions. [2019-11-15 22:37:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-15 22:37:12,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:12,587 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-15 22:37:12,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:12,791 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1448290572, now seen corresponding path program 1 times [2019-11-15 22:37:12,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:12,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463010688] [2019-11-15 22:37:12,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:12,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:12,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-11-15 22:37:12,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463010688] [2019-11-15 22:37:12,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:12,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:12,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988757593] [2019-11-15 22:37:12,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:12,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:12,898 INFO L87 Difference]: Start difference. First operand 1443 states and 2168 transitions. Second operand 4 states. [2019-11-15 22:37:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:13,194 INFO L93 Difference]: Finished difference Result 2978 states and 4479 transitions. [2019-11-15 22:37:13,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:13,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-15 22:37:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:13,196 INFO L225 Difference]: With dead ends: 2978 [2019-11-15 22:37:13,197 INFO L226 Difference]: Without dead ends: 1554 [2019-11-15 22:37:13,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-11-15 22:37:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1506. [2019-11-15 22:37:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2019-11-15 22:37:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2273 transitions. [2019-11-15 22:37:13,279 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2273 transitions. Word has length 223 [2019-11-15 22:37:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:13,279 INFO L462 AbstractCegarLoop]: Abstraction has 1506 states and 2273 transitions. [2019-11-15 22:37:13,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2273 transitions. [2019-11-15 22:37:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-15 22:37:13,282 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:13,282 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:13,282 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:13,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:13,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1609780127, now seen corresponding path program 1 times [2019-11-15 22:37:13,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:13,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496657242] [2019-11-15 22:37:13,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:13,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:13,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-11-15 22:37:13,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496657242] [2019-11-15 22:37:13,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:13,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:13,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23551728] [2019-11-15 22:37:13,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:13,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:13,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:13,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:13,383 INFO L87 Difference]: Start difference. First operand 1506 states and 2273 transitions. Second operand 4 states. [2019-11-15 22:37:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:13,925 INFO L93 Difference]: Finished difference Result 3197 states and 4823 transitions. [2019-11-15 22:37:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:13,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-11-15 22:37:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:13,927 INFO L225 Difference]: With dead ends: 3197 [2019-11-15 22:37:13,927 INFO L226 Difference]: Without dead ends: 1710 [2019-11-15 22:37:13,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2019-11-15 22:37:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1611. [2019-11-15 22:37:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-11-15 22:37:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2447 transitions. [2019-11-15 22:37:13,998 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2447 transitions. Word has length 224 [2019-11-15 22:37:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:13,998 INFO L462 AbstractCegarLoop]: Abstraction has 1611 states and 2447 transitions. [2019-11-15 22:37:13,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2447 transitions. [2019-11-15 22:37:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-15 22:37:13,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:13,999 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:37:13,999 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:14,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1270050593, now seen corresponding path program 1 times [2019-11-15 22:37:14,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:14,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986527594] [2019-11-15 22:37:14,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:14,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:14,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 254 proven. 78 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-15 22:37:14,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986527594] [2019-11-15 22:37:14,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022154278] [2019-11-15 22:37:14,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:14,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:37:14,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:14,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-11-15 22:37:14,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 16 [2019-11-15 22:37:14,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:37:14,388 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 22:37:14,388 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:14,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:14,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:14,394 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 22:37:14,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:37:14,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:14,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:14,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:14,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 22:37:14,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-15 22:37:14,429 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 22:37:14,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 22:37:14,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:14,440 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 22:37:14,441 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:14,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:14,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:14,450 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 22:37:14,483 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:37:14,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:37:14,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:14,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:14,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:14,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 22:37:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 256 proven. 8 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-11-15 22:37:14,552 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:14,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 22:37:14,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579956827] [2019-11-15 22:37:14,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:37:14,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:14,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:37:14,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:14,553 INFO L87 Difference]: Start difference. First operand 1611 states and 2447 transitions. Second operand 9 states. [2019-11-15 22:37:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:15,437 INFO L93 Difference]: Finished difference Result 3461 states and 5215 transitions. [2019-11-15 22:37:15,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:37:15,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2019-11-15 22:37:15,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:15,439 INFO L225 Difference]: With dead ends: 3461 [2019-11-15 22:37:15,440 INFO L226 Difference]: Without dead ends: 1869 [2019-11-15 22:37:15,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:37:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-11-15 22:37:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1611. [2019-11-15 22:37:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-11-15 22:37:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2441 transitions. [2019-11-15 22:37:15,496 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2441 transitions. Word has length 224 [2019-11-15 22:37:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:15,496 INFO L462 AbstractCegarLoop]: Abstraction has 1611 states and 2441 transitions. [2019-11-15 22:37:15,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:37:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2441 transitions. [2019-11-15 22:37:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-15 22:37:15,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:15,498 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:37:15,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:15,701 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1838111843, now seen corresponding path program 1 times [2019-11-15 22:37:15,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:15,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406103936] [2019-11-15 22:37:15,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:15,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:15,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 256 proven. 80 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-15 22:37:15,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406103936] [2019-11-15 22:37:15,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630170176] [2019-11-15 22:37:15,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:16,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:37:16,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:16,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-11-15 22:37:16,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 16 [2019-11-15 22:37:16,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:37:16,049 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 22:37:16,050 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:16,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:16,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:16,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 22:37:16,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:37:16,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:16,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:16,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:16,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 22:37:16,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-15 22:37:16,094 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 22:37:16,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 22:37:16,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:16,105 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 22:37:16,105 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:16,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:16,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:16,110 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 22:37:16,131 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:37:16,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 22:37:16,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:16,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:16,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:16,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 22:37:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 259 proven. 7 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-11-15 22:37:16,208 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:16,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 22:37:16,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148671804] [2019-11-15 22:37:16,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:37:16,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:37:16,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:16,209 INFO L87 Difference]: Start difference. First operand 1611 states and 2441 transitions. Second operand 9 states. [2019-11-15 22:37:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:17,010 INFO L93 Difference]: Finished difference Result 3455 states and 5197 transitions. [2019-11-15 22:37:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:37:17,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 225 [2019-11-15 22:37:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:17,012 INFO L225 Difference]: With dead ends: 3455 [2019-11-15 22:37:17,012 INFO L226 Difference]: Without dead ends: 1863 [2019-11-15 22:37:17,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:37:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2019-11-15 22:37:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1611. [2019-11-15 22:37:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-11-15 22:37:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2435 transitions. [2019-11-15 22:37:17,068 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2435 transitions. Word has length 225 [2019-11-15 22:37:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:17,068 INFO L462 AbstractCegarLoop]: Abstraction has 1611 states and 2435 transitions. [2019-11-15 22:37:17,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:37:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2435 transitions. [2019-11-15 22:37:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-15 22:37:17,070 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:17,070 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:37:17,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:17,271 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash 389258756, now seen corresponding path program 1 times [2019-11-15 22:37:17,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:17,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540305557] [2019-11-15 22:37:17,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:17,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:17,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-15 22:37:17,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540305557] [2019-11-15 22:37:17,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:17,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:17,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862289509] [2019-11-15 22:37:17,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:17,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:17,375 INFO L87 Difference]: Start difference. First operand 1611 states and 2435 transitions. Second operand 4 states. [2019-11-15 22:37:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:17,815 INFO L93 Difference]: Finished difference Result 3428 states and 5177 transitions. [2019-11-15 22:37:17,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:17,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-11-15 22:37:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:17,817 INFO L225 Difference]: With dead ends: 3428 [2019-11-15 22:37:17,817 INFO L226 Difference]: Without dead ends: 1836 [2019-11-15 22:37:17,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2019-11-15 22:37:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1728. [2019-11-15 22:37:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1728 states. [2019-11-15 22:37:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2627 transitions. [2019-11-15 22:37:17,885 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2627 transitions. Word has length 226 [2019-11-15 22:37:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:17,885 INFO L462 AbstractCegarLoop]: Abstraction has 1728 states and 2627 transitions. [2019-11-15 22:37:17,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2627 transitions. [2019-11-15 22:37:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-15 22:37:17,887 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:17,887 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:17,887 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash -544723992, now seen corresponding path program 1 times [2019-11-15 22:37:17,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:17,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849954403] [2019-11-15 22:37:17,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:17,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:17,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-15 22:37:17,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849954403] [2019-11-15 22:37:17,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:17,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:17,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847210499] [2019-11-15 22:37:17,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:17,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:17,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:17,974 INFO L87 Difference]: Start difference. First operand 1728 states and 2627 transitions. Second operand 4 states. [2019-11-15 22:37:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:18,301 INFO L93 Difference]: Finished difference Result 3539 states and 5370 transitions. [2019-11-15 22:37:18,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:18,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-15 22:37:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:18,303 INFO L225 Difference]: With dead ends: 3539 [2019-11-15 22:37:18,303 INFO L226 Difference]: Without dead ends: 1824 [2019-11-15 22:37:18,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-11-15 22:37:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1779. [2019-11-15 22:37:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-15 22:37:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2705 transitions. [2019-11-15 22:37:18,382 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2705 transitions. Word has length 228 [2019-11-15 22:37:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:18,383 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2705 transitions. [2019-11-15 22:37:18,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2705 transitions. [2019-11-15 22:37:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 22:37:18,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:18,385 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:18,385 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:18,385 INFO L82 PathProgramCache]: Analyzing trace with hash 293313977, now seen corresponding path program 1 times [2019-11-15 22:37:18,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:18,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393964438] [2019-11-15 22:37:18,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:18,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:18,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-15 22:37:18,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393964438] [2019-11-15 22:37:18,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:18,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:18,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84408199] [2019-11-15 22:37:18,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:18,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:18,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:18,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:18,497 INFO L87 Difference]: Start difference. First operand 1779 states and 2705 transitions. Second operand 4 states. [2019-11-15 22:37:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:18,996 INFO L93 Difference]: Finished difference Result 3620 states and 5492 transitions. [2019-11-15 22:37:18,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:18,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-15 22:37:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:18,999 INFO L225 Difference]: With dead ends: 3620 [2019-11-15 22:37:18,999 INFO L226 Difference]: Without dead ends: 1860 [2019-11-15 22:37:19,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2019-11-15 22:37:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1779. [2019-11-15 22:37:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-15 22:37:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2702 transitions. [2019-11-15 22:37:19,090 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2702 transitions. Word has length 229 [2019-11-15 22:37:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:19,090 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2702 transitions. [2019-11-15 22:37:19,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2702 transitions. [2019-11-15 22:37:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 22:37:19,093 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:19,093 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:19,093 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1684939052, now seen corresponding path program 1 times [2019-11-15 22:37:19,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:19,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477568076] [2019-11-15 22:37:19,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-15 22:37:19,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477568076] [2019-11-15 22:37:19,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:19,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:19,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962288584] [2019-11-15 22:37:19,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:19,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:19,209 INFO L87 Difference]: Start difference. First operand 1779 states and 2702 transitions. Second operand 4 states. [2019-11-15 22:37:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:19,769 INFO L93 Difference]: Finished difference Result 3620 states and 5486 transitions. [2019-11-15 22:37:19,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:19,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-15 22:37:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:19,772 INFO L225 Difference]: With dead ends: 3620 [2019-11-15 22:37:19,772 INFO L226 Difference]: Without dead ends: 1860 [2019-11-15 22:37:19,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2019-11-15 22:37:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1779. [2019-11-15 22:37:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-15 22:37:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2699 transitions. [2019-11-15 22:37:19,864 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2699 transitions. Word has length 230 [2019-11-15 22:37:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:19,864 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2699 transitions. [2019-11-15 22:37:19,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2699 transitions. [2019-11-15 22:37:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-15 22:37:19,866 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:19,867 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:19,867 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:19,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:19,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1048338210, now seen corresponding path program 1 times [2019-11-15 22:37:19,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:19,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746396440] [2019-11-15 22:37:19,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:19,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-15 22:37:19,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746396440] [2019-11-15 22:37:19,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:19,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:19,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415434011] [2019-11-15 22:37:19,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:19,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:19,983 INFO L87 Difference]: Start difference. First operand 1779 states and 2699 transitions. Second operand 4 states. [2019-11-15 22:37:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:20,383 INFO L93 Difference]: Finished difference Result 3620 states and 5480 transitions. [2019-11-15 22:37:20,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:20,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-15 22:37:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:20,385 INFO L225 Difference]: With dead ends: 3620 [2019-11-15 22:37:20,386 INFO L226 Difference]: Without dead ends: 1860 [2019-11-15 22:37:20,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2019-11-15 22:37:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1779. [2019-11-15 22:37:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-15 22:37:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2696 transitions. [2019-11-15 22:37:20,470 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2696 transitions. Word has length 231 [2019-11-15 22:37:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:20,470 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2696 transitions. [2019-11-15 22:37:20,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2696 transitions. [2019-11-15 22:37:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 22:37:20,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:20,472 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:37:20,472 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:20,472 INFO L82 PathProgramCache]: Analyzing trace with hash 526801537, now seen corresponding path program 1 times [2019-11-15 22:37:20,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:20,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768571578] [2019-11-15 22:37:20,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 22:37:20,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768571578] [2019-11-15 22:37:20,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:20,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:37:20,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681539104] [2019-11-15 22:37:20,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:37:20,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:20,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:37:20,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:20,720 INFO L87 Difference]: Start difference. First operand 1779 states and 2696 transitions. Second operand 5 states. [2019-11-15 22:37:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:21,895 INFO L93 Difference]: Finished difference Result 3829 states and 5782 transitions. [2019-11-15 22:37:21,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:37:21,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-11-15 22:37:21,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:21,898 INFO L225 Difference]: With dead ends: 3829 [2019-11-15 22:37:21,898 INFO L226 Difference]: Without dead ends: 2069 [2019-11-15 22:37:21,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-11-15 22:37:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1848. [2019-11-15 22:37:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 22:37:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2807 transitions. [2019-11-15 22:37:22,005 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2807 transitions. Word has length 232 [2019-11-15 22:37:22,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:22,006 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2807 transitions. [2019-11-15 22:37:22,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:37:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2807 transitions. [2019-11-15 22:37:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 22:37:22,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:22,008 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:37:22,009 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:22,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:22,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1615058941, now seen corresponding path program 1 times [2019-11-15 22:37:22,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:22,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628973580] [2019-11-15 22:37:22,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:22,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:22,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 22:37:22,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628973580] [2019-11-15 22:37:22,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:22,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:37:22,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288846087] [2019-11-15 22:37:22,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:37:22,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:22,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:37:22,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:37:22,337 INFO L87 Difference]: Start difference. First operand 1848 states and 2807 transitions. Second operand 6 states. [2019-11-15 22:37:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:23,742 INFO L93 Difference]: Finished difference Result 4152 states and 6245 transitions. [2019-11-15 22:37:23,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:37:23,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 232 [2019-11-15 22:37:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:23,745 INFO L225 Difference]: With dead ends: 4152 [2019-11-15 22:37:23,745 INFO L226 Difference]: Without dead ends: 2323 [2019-11-15 22:37:23,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-11-15 22:37:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1845. [2019-11-15 22:37:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 22:37:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2804 transitions. [2019-11-15 22:37:23,811 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2804 transitions. Word has length 232 [2019-11-15 22:37:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:23,811 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2804 transitions. [2019-11-15 22:37:23,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:37:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2804 transitions. [2019-11-15 22:37:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 22:37:23,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:23,813 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:37:23,813 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1722133508, now seen corresponding path program 1 times [2019-11-15 22:37:23,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:23,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596666018] [2019-11-15 22:37:23,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:23,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:23,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 22:37:23,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596666018] [2019-11-15 22:37:23,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:23,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:37:23,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646140495] [2019-11-15 22:37:23,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:37:23,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:23,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:37:23,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:23,968 INFO L87 Difference]: Start difference. First operand 1845 states and 2804 transitions. Second operand 5 states. [2019-11-15 22:37:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:24,783 INFO L93 Difference]: Finished difference Result 3946 states and 5972 transitions. [2019-11-15 22:37:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:37:24,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-11-15 22:37:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:24,785 INFO L225 Difference]: With dead ends: 3946 [2019-11-15 22:37:24,785 INFO L226 Difference]: Without dead ends: 2120 [2019-11-15 22:37:24,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2019-11-15 22:37:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1917. [2019-11-15 22:37:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1917 states. [2019-11-15 22:37:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2918 transitions. [2019-11-15 22:37:24,851 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2918 transitions. Word has length 233 [2019-11-15 22:37:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:24,851 INFO L462 AbstractCegarLoop]: Abstraction has 1917 states and 2918 transitions. [2019-11-15 22:37:24,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:37:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2918 transitions. [2019-11-15 22:37:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 22:37:24,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:24,853 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:37:24,853 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash 599668410, now seen corresponding path program 1 times [2019-11-15 22:37:24,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:24,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996311403] [2019-11-15 22:37:24,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:24,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:24,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 22:37:24,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996311403] [2019-11-15 22:37:24,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:24,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:37:24,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778508467] [2019-11-15 22:37:24,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:37:24,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:24,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:37:24,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:24,991 INFO L87 Difference]: Start difference. First operand 1917 states and 2918 transitions. Second operand 5 states. [2019-11-15 22:37:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:25,479 INFO L93 Difference]: Finished difference Result 4021 states and 6086 transitions. [2019-11-15 22:37:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:37:25,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-11-15 22:37:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:25,481 INFO L225 Difference]: With dead ends: 4021 [2019-11-15 22:37:25,481 INFO L226 Difference]: Without dead ends: 2123 [2019-11-15 22:37:25,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-11-15 22:37:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1848. [2019-11-15 22:37:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 22:37:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2804 transitions. [2019-11-15 22:37:25,572 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2804 transitions. Word has length 233 [2019-11-15 22:37:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:25,573 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2804 transitions. [2019-11-15 22:37:25,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:37:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2804 transitions. [2019-11-15 22:37:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-15 22:37:25,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:25,574 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 22:37:25,574 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:25,575 INFO L82 PathProgramCache]: Analyzing trace with hash -911411502, now seen corresponding path program 1 times [2019-11-15 22:37:25,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:25,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920343200] [2019-11-15 22:37:25,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:25,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:25,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-15 22:37:25,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920343200] [2019-11-15 22:37:25,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:25,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:25,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516531244] [2019-11-15 22:37:25,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:25,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:25,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:25,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:25,663 INFO L87 Difference]: Start difference. First operand 1848 states and 2804 transitions. Second operand 4 states. [2019-11-15 22:37:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:26,216 INFO L93 Difference]: Finished difference Result 3722 states and 5637 transitions. [2019-11-15 22:37:26,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:26,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-11-15 22:37:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:26,218 INFO L225 Difference]: With dead ends: 3722 [2019-11-15 22:37:26,218 INFO L226 Difference]: Without dead ends: 1893 [2019-11-15 22:37:26,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-11-15 22:37:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1848. [2019-11-15 22:37:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 22:37:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2801 transitions. [2019-11-15 22:37:26,283 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2801 transitions. Word has length 235 [2019-11-15 22:37:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:26,284 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2801 transitions. [2019-11-15 22:37:26,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2801 transitions. [2019-11-15 22:37:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-15 22:37:26,285 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:26,285 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 22:37:26,285 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:26,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash 667655968, now seen corresponding path program 1 times [2019-11-15 22:37:26,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:26,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553915293] [2019-11-15 22:37:26,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:26,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:26,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-15 22:37:26,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553915293] [2019-11-15 22:37:26,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:26,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:26,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368464778] [2019-11-15 22:37:26,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:26,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:26,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:26,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:26,380 INFO L87 Difference]: Start difference. First operand 1848 states and 2801 transitions. Second operand 4 states. [2019-11-15 22:37:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:26,691 INFO L93 Difference]: Finished difference Result 3709 states and 5621 transitions. [2019-11-15 22:37:26,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:26,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-15 22:37:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:26,693 INFO L225 Difference]: With dead ends: 3709 [2019-11-15 22:37:26,693 INFO L226 Difference]: Without dead ends: 1880 [2019-11-15 22:37:26,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2019-11-15 22:37:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1848. [2019-11-15 22:37:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 22:37:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2798 transitions. [2019-11-15 22:37:26,757 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2798 transitions. Word has length 236 [2019-11-15 22:37:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:26,758 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2798 transitions. [2019-11-15 22:37:26,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2798 transitions. [2019-11-15 22:37:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-15 22:37:26,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:26,759 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:26,759 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1968253399, now seen corresponding path program 1 times [2019-11-15 22:37:26,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:26,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980394774] [2019-11-15 22:37:26,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:26,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:26,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-15 22:37:26,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980394774] [2019-11-15 22:37:26,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:26,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:26,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282701400] [2019-11-15 22:37:26,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:26,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:26,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:26,861 INFO L87 Difference]: Start difference. First operand 1848 states and 2798 transitions. Second operand 4 states. [2019-11-15 22:37:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:27,180 INFO L93 Difference]: Finished difference Result 3709 states and 5615 transitions. [2019-11-15 22:37:27,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:27,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-11-15 22:37:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:27,182 INFO L225 Difference]: With dead ends: 3709 [2019-11-15 22:37:27,182 INFO L226 Difference]: Without dead ends: 1880 [2019-11-15 22:37:27,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2019-11-15 22:37:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1848. [2019-11-15 22:37:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 22:37:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2795 transitions. [2019-11-15 22:37:27,254 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2795 transitions. Word has length 245 [2019-11-15 22:37:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:27,254 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2795 transitions. [2019-11-15 22:37:27,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2795 transitions. [2019-11-15 22:37:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-15 22:37:27,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:27,257 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:27,257 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:27,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1411057200, now seen corresponding path program 1 times [2019-11-15 22:37:27,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:27,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401476506] [2019-11-15 22:37:27,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:27,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:27,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-15 22:37:27,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401476506] [2019-11-15 22:37:27,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:27,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:27,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879941309] [2019-11-15 22:37:27,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:27,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:27,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:27,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:27,363 INFO L87 Difference]: Start difference. First operand 1848 states and 2795 transitions. Second operand 4 states. [2019-11-15 22:37:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:27,678 INFO L93 Difference]: Finished difference Result 3703 states and 5603 transitions. [2019-11-15 22:37:27,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:27,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-11-15 22:37:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:27,679 INFO L225 Difference]: With dead ends: 3703 [2019-11-15 22:37:27,680 INFO L226 Difference]: Without dead ends: 1874 [2019-11-15 22:37:27,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2019-11-15 22:37:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1848. [2019-11-15 22:37:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 22:37:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2792 transitions. [2019-11-15 22:37:27,749 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2792 transitions. Word has length 246 [2019-11-15 22:37:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:27,749 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2792 transitions. [2019-11-15 22:37:27,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2792 transitions. [2019-11-15 22:37:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-15 22:37:27,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:27,751 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-15 22:37:27,751 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:27,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:27,752 INFO L82 PathProgramCache]: Analyzing trace with hash -823623646, now seen corresponding path program 1 times [2019-11-15 22:37:27,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:27,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356400463] [2019-11-15 22:37:27,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:27,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:27,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 328 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-15 22:37:27,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356400463] [2019-11-15 22:37:27,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999494025] [2019-11-15 22:37:27,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:28,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:37:28,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:28,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 22:37:28,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:28,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:28,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:28,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 22:37:28,154 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_158|], 5=[|v_#memory_int_191|]} [2019-11-15 22:37:28,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2019-11-15 22:37:28,160 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:37:28,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:28,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2019-11-15 22:37:28,165 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:37:28,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:28,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:28,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-15 22:37:28,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:28,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:28,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:28,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:28,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:28,427 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:37:28,430 INFO L168 Benchmark]: Toolchain (without parser) took 76828.68 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 22:37:28,430 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:37:28,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:37:28,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:37:28,431 INFO L168 Benchmark]: Boogie Preprocessor took 98.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:37:28,431 INFO L168 Benchmark]: RCFGBuilder took 1317.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:37:28,431 INFO L168 Benchmark]: TraceAbstraction took 74634.04 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -67.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 22:37:28,435 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 698.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1317.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74634.04 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -67.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:37:30,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:37:30,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:37:30,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:37:30,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:37:30,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:37:30,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:37:30,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:37:30,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:37:30,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:37:30,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:37:30,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:37:30,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:37:30,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:37:30,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:37:30,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:37:30,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:37:30,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:37:30,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:37:30,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:37:30,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:37:30,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:37:30,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:37:30,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:37:30,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:37:30,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:37:30,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:37:30,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:37:30,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:37:30,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:37:30,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:37:30,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:37:30,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:37:30,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:37:30,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:37:30,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:37:30,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:37:30,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:37:30,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:37:30,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:37:30,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:37:30,578 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:37:30,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:37:30,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:37:30,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:37:30,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:37:30,594 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:37:30,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:37:30,594 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:37:30,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:37:30,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:37:30,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:37:30,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:37:30,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:37:30,596 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:37:30,596 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:37:30,596 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:37:30,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:37:30,597 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:37:30,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:37:30,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:37:30,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:37:30,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:37:30,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:37:30,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:37:30,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:37:30,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:37:30,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:37:30,599 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:37:30,599 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:37:30,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:37:30,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:37:30,600 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/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 -> c8531c852aede4d90d76778a05ed8837cee15399 [2019-11-15 22:37:30,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:37:30,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:37:30,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:37:30,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:37:30,644 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:37:30,645 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c [2019-11-15 22:37:30,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data/79315ca3d/7b642e27b8d14ae584bb94eaba002188/FLAG093109a01 [2019-11-15 22:37:31,224 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:37:31,225 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c [2019-11-15 22:37:31,255 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data/79315ca3d/7b642e27b8d14ae584bb94eaba002188/FLAG093109a01 [2019-11-15 22:37:31,462 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/data/79315ca3d/7b642e27b8d14ae584bb94eaba002188 [2019-11-15 22:37:31,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:37:31,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:37:31,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:37:31,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:37:31,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:37:31,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:37:31" (1/1) ... [2019-11-15 22:37:31,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a9510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:31, skipping insertion in model container [2019-11-15 22:37:31,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:37:31" (1/1) ... [2019-11-15 22:37:31,487 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:37:31,583 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:37:32,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:37:32,179 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:37:32,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:37:32,350 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:37:32,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32 WrapperNode [2019-11-15 22:37:32,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:37:32,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:37:32,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:37:32,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:37:32,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... [2019-11-15 22:37:32,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... [2019-11-15 22:37:32,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:37:32,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:37:32,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:37:32,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:37:32,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... [2019-11-15 22:37:32,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... [2019-11-15 22:37:32,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... [2019-11-15 22:37:32,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... [2019-11-15 22:37:32,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... [2019-11-15 22:37:32,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... [2019-11-15 22:37:32,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... [2019-11-15 22:37:32,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:37:32,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:37:32,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:37:32,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:37:32,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:37:32,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:37:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:37:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:37:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:37:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:37:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:37:32,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:37:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:37:32,844 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:37:36,385 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:37:36,385 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:37:36,386 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:37:36,386 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:37:36,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:37:36 BoogieIcfgContainer [2019-11-15 22:37:36,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:37:36,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:37:36,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:37:36,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:37:36,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:37:31" (1/3) ... [2019-11-15 22:37:36,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749eec56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:37:36, skipping insertion in model container [2019-11-15 22:37:36,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:32" (2/3) ... [2019-11-15 22:37:36,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749eec56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:37:36, skipping insertion in model container [2019-11-15 22:37:36,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:37:36" (3/3) ... [2019-11-15 22:37:36,395 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-2.c [2019-11-15 22:37:36,404 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:37:36,412 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:37:36,421 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:37:36,443 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:37:36,443 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:37:36,443 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:37:36,443 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:37:36,443 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:37:36,443 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:37:36,444 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:37:36,444 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:37:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-15 22:37:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:37:36,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:36,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:36,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-15 22:37:36,482 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:37:36,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [36867831] [2019-11-15 22:37:36,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:36,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:37:36,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:36,728 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:37:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:36,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [36867831] [2019-11-15 22:37:36,773 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:36,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:37:36,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925418243] [2019-11-15 22:37:36,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:36,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:37:36,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:36,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:36,797 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-15 22:37:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:36,938 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2019-11-15 22:37:36,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:36,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 22:37:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:36,956 INFO L225 Difference]: With dead ends: 540 [2019-11-15 22:37:36,956 INFO L226 Difference]: Without dead ends: 366 [2019-11-15 22:37:36,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-15 22:37:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-11-15 22:37:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-15 22:37:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2019-11-15 22:37:37,074 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2019-11-15 22:37:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:37,075 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2019-11-15 22:37:37,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2019-11-15 22:37:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:37:37,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:37,088 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:37,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:37,291 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1984491269, now seen corresponding path program 1 times [2019-11-15 22:37:37,293 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:37:37,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1898580986] [2019-11-15 22:37:37,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:37,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:37:37,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:37,550 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:37:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:37,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1898580986] [2019-11-15 22:37:37,570 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:37,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 22:37:37,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228109389] [2019-11-15 22:37:37,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:37:37,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:37:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:37:37,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:37:37,573 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 3 states. [2019-11-15 22:37:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:37,825 INFO L93 Difference]: Finished difference Result 721 states and 1100 transitions. [2019-11-15 22:37:37,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:37:37,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-15 22:37:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:37,829 INFO L225 Difference]: With dead ends: 721 [2019-11-15 22:37:37,829 INFO L226 Difference]: Without dead ends: 482 [2019-11-15 22:37:37,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:37:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-15 22:37:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-11-15 22:37:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-11-15 22:37:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 731 transitions. [2019-11-15 22:37:37,856 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 731 transitions. Word has length 85 [2019-11-15 22:37:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:37,856 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 731 transitions. [2019-11-15 22:37:37,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:37:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 731 transitions. [2019-11-15 22:37:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 22:37:37,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:37,861 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:38,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:38,068 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash 20336871, now seen corresponding path program 1 times [2019-11-15 22:37:38,069 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:37:38,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [91403282] [2019-11-15 22:37:38,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:38,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:37:38,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:37:38,412 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:37:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:37:38,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [91403282] [2019-11-15 22:37:38,463 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:38,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:37:38,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39495609] [2019-11-15 22:37:38,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:38,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:37:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:38,467 INFO L87 Difference]: Start difference. First operand 482 states and 731 transitions. Second operand 4 states. [2019-11-15 22:37:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:38,756 INFO L93 Difference]: Finished difference Result 1072 states and 1634 transitions. [2019-11-15 22:37:38,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:38,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-15 22:37:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:38,763 INFO L225 Difference]: With dead ends: 1072 [2019-11-15 22:37:38,763 INFO L226 Difference]: Without dead ends: 717 [2019-11-15 22:37:38,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-15 22:37:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-11-15 22:37:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-11-15 22:37:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1087 transitions. [2019-11-15 22:37:38,802 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1087 transitions. Word has length 107 [2019-11-15 22:37:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:38,803 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1087 transitions. [2019-11-15 22:37:38,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1087 transitions. [2019-11-15 22:37:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 22:37:38,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:38,808 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:37:39,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:39,009 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:39,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:39,010 INFO L82 PathProgramCache]: Analyzing trace with hash 856260688, now seen corresponding path program 1 times [2019-11-15 22:37:39,011 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:37:39,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2109038507] [2019-11-15 22:37:39,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:39,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:37:39,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:40,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:40,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:37:40,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:40,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:40,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:40,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:37:40,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:40,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:37:40,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:40,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:40,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:40,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:37:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:37:40,175 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:37:40,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:37:40,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:40,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:40,261 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:40,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:40,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:40,263 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:37:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:37:40,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2109038507] [2019-11-15 22:37:40,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:37:40,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:37:40,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090704325] [2019-11-15 22:37:40,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:40,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:37:40,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:40,295 INFO L87 Difference]: Start difference. First operand 717 states and 1087 transitions. Second operand 4 states. [2019-11-15 22:37:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:44,329 INFO L93 Difference]: Finished difference Result 2093 states and 3189 transitions. [2019-11-15 22:37:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:44,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 22:37:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:44,345 INFO L225 Difference]: With dead ends: 2093 [2019-11-15 22:37:44,346 INFO L226 Difference]: Without dead ends: 1384 [2019-11-15 22:37:44,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:37:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2019-11-15 22:37:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 849. [2019-11-15 22:37:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-11-15 22:37:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1315 transitions. [2019-11-15 22:37:44,389 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1315 transitions. Word has length 148 [2019-11-15 22:37:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:44,390 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1315 transitions. [2019-11-15 22:37:44,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1315 transitions. [2019-11-15 22:37:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 22:37:44,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:44,393 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:44,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:44,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:44,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:44,602 INFO L82 PathProgramCache]: Analyzing trace with hash -670623159, now seen corresponding path program 1 times [2019-11-15 22:37:44,603 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:37:44,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1724226668] [2019-11-15 22:37:44,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:45,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:37:45,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:45,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:45,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:37:45,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:45,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:45,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:45,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:37:45,541 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:45,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:37:45,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:45,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:45,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:45,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:37:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:37:45,606 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:37:45,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:37:45,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:45,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:45,681 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:45,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:45,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:45,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:37:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:37:45,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1724226668] [2019-11-15 22:37:45,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:37:45,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:37:45,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690697036] [2019-11-15 22:37:45,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:45,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:37:45,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:45,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:45,721 INFO L87 Difference]: Start difference. First operand 849 states and 1315 transitions. Second operand 4 states. [2019-11-15 22:37:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:50,423 INFO L93 Difference]: Finished difference Result 2330 states and 3600 transitions. [2019-11-15 22:37:50,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:50,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-15 22:37:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:50,434 INFO L225 Difference]: With dead ends: 2330 [2019-11-15 22:37:50,434 INFO L226 Difference]: Without dead ends: 1489 [2019-11-15 22:37:50,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:37:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2019-11-15 22:37:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 965. [2019-11-15 22:37:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-15 22:37:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1516 transitions. [2019-11-15 22:37:50,474 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1516 transitions. Word has length 149 [2019-11-15 22:37:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:50,476 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1516 transitions. [2019-11-15 22:37:50,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1516 transitions. [2019-11-15 22:37:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 22:37:50,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:50,482 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:37:50,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:50,689 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:50,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2100849831, now seen corresponding path program 1 times [2019-11-15 22:37:50,690 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:37:50,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [580769803] [2019-11-15 22:37:50,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:51,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:37:51,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:51,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:51,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:37:51,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:51,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:51,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:51,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:37:51,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:51,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:37:51,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:51,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:51,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:51,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:37:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 181 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 22:37:52,034 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:37:52,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:37:52,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:52,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:52,091 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:52,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:52,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:52,092 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:37:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 22:37:52,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [580769803] [2019-11-15 22:37:52,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:37:52,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:37:52,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191123545] [2019-11-15 22:37:52,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:52,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:37:52,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:52,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:52,109 INFO L87 Difference]: Start difference. First operand 965 states and 1516 transitions. Second operand 4 states. [2019-11-15 22:37:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:55,539 INFO L93 Difference]: Finished difference Result 2444 states and 3813 transitions. [2019-11-15 22:37:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:55,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-15 22:37:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:55,549 INFO L225 Difference]: With dead ends: 2444 [2019-11-15 22:37:55,550 INFO L226 Difference]: Without dead ends: 1627 [2019-11-15 22:37:55,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:37:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-11-15 22:37:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1079. [2019-11-15 22:37:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-15 22:37:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1703 transitions. [2019-11-15 22:37:55,594 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1703 transitions. Word has length 165 [2019-11-15 22:37:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:55,594 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1703 transitions. [2019-11-15 22:37:55,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1703 transitions. [2019-11-15 22:37:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-15 22:37:55,598 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:55,598 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:37:55,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:55,803 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:55,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1366456425, now seen corresponding path program 1 times [2019-11-15 22:37:55,804 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:37:55,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1527181428] [2019-11-15 22:37:55,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:37:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:56,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:37:56,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:56,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:56,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:37:56,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:56,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:56,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:56,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:37:56,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:56,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:37:56,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:56,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:56,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:56,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:37:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 186 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 22:37:56,836 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:37:56,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:37:56,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:56,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:56,875 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:56,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:56,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:56,876 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:37:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 22:37:56,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1527181428] [2019-11-15 22:37:56,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:37:56,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:37:56,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571262713] [2019-11-15 22:37:56,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:56,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:37:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:56,918 INFO L87 Difference]: Start difference. First operand 1079 states and 1703 transitions. Second operand 4 states. [2019-11-15 22:38:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:01,151 INFO L93 Difference]: Finished difference Result 2550 states and 3977 transitions. [2019-11-15 22:38:01,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:01,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-15 22:38:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:01,161 INFO L225 Difference]: With dead ends: 2550 [2019-11-15 22:38:01,161 INFO L226 Difference]: Without dead ends: 1638 [2019-11-15 22:38:01,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2019-11-15 22:38:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1096. [2019-11-15 22:38:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-11-15 22:38:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1724 transitions. [2019-11-15 22:38:01,211 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1724 transitions. Word has length 166 [2019-11-15 22:38:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:01,211 INFO L462 AbstractCegarLoop]: Abstraction has 1096 states and 1724 transitions. [2019-11-15 22:38:01,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1724 transitions. [2019-11-15 22:38:01,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 22:38:01,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:01,215 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:38:01,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:01,426 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:01,426 INFO L82 PathProgramCache]: Analyzing trace with hash 312464066, now seen corresponding path program 1 times [2019-11-15 22:38:01,426 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:01,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [620705365] [2019-11-15 22:38:01,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:02,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:02,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:02,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:02,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:02,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:02,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:02,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:02,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:02,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:02,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:02,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:02,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:02,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:02,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 190 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 22:38:02,474 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:02,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:02,507 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:02,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:02,510 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:02,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:02,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:02,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 22:38:02,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [620705365] [2019-11-15 22:38:02,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:02,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:02,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110655608] [2019-11-15 22:38:02,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:02,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:02,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:02,534 INFO L87 Difference]: Start difference. First operand 1096 states and 1724 transitions. Second operand 4 states. [2019-11-15 22:38:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:05,178 INFO L93 Difference]: Finished difference Result 2675 states and 4164 transitions. [2019-11-15 22:38:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:05,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-11-15 22:38:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:05,187 INFO L225 Difference]: With dead ends: 2675 [2019-11-15 22:38:05,188 INFO L226 Difference]: Without dead ends: 1758 [2019-11-15 22:38:05,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-11-15 22:38:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1222. [2019-11-15 22:38:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-11-15 22:38:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1923 transitions. [2019-11-15 22:38:05,235 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1923 transitions. Word has length 167 [2019-11-15 22:38:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:05,235 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1923 transitions. [2019-11-15 22:38:05,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1923 transitions. [2019-11-15 22:38:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 22:38:05,239 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:05,239 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 22:38:05,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:05,447 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash 765984004, now seen corresponding path program 1 times [2019-11-15 22:38:05,448 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:05,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [982044201] [2019-11-15 22:38:05,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:06,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:06,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:06,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:06,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:06,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:06,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:06,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 212 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 22:38:06,469 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:06,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:06,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,500 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,501 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 22:38:06,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [982044201] [2019-11-15 22:38:06,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:06,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:06,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845049057] [2019-11-15 22:38:06,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:06,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:06,558 INFO L87 Difference]: Start difference. First operand 1222 states and 1923 transitions. Second operand 4 states. [2019-11-15 22:38:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:09,903 INFO L93 Difference]: Finished difference Result 3069 states and 4781 transitions. [2019-11-15 22:38:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:09,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-15 22:38:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:09,913 INFO L225 Difference]: With dead ends: 3069 [2019-11-15 22:38:09,913 INFO L226 Difference]: Without dead ends: 1866 [2019-11-15 22:38:09,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-11-15 22:38:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1414. [2019-11-15 22:38:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-15 22:38:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2241 transitions. [2019-11-15 22:38:09,966 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2241 transitions. Word has length 177 [2019-11-15 22:38:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:09,967 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2241 transitions. [2019-11-15 22:38:09,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2241 transitions. [2019-11-15 22:38:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 22:38:09,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:09,971 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:10,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:10,179 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:10,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1311943816, now seen corresponding path program 1 times [2019-11-15 22:38:10,180 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:10,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [859120100] [2019-11-15 22:38:10,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:11,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:11,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:11,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:11,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:11,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:11,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:11,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:11,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:11,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:11,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:11,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:11,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:11,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:11,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 186 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:11,509 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:11,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:11,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:11,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:11,550 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:11,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:11,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:11,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:11,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [859120100] [2019-11-15 22:38:11,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:11,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:11,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409023911] [2019-11-15 22:38:11,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:11,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:11,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:11,574 INFO L87 Difference]: Start difference. First operand 1414 states and 2241 transitions. Second operand 4 states. [2019-11-15 22:38:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:15,939 INFO L93 Difference]: Finished difference Result 3327 states and 5219 transitions. [2019-11-15 22:38:15,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:15,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-15 22:38:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:15,950 INFO L225 Difference]: With dead ends: 3327 [2019-11-15 22:38:15,950 INFO L226 Difference]: Without dead ends: 1932 [2019-11-15 22:38:15,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-15 22:38:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1414. [2019-11-15 22:38:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-15 22:38:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2211 transitions. [2019-11-15 22:38:16,005 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2211 transitions. Word has length 180 [2019-11-15 22:38:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:16,005 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2211 transitions. [2019-11-15 22:38:16,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2211 transitions. [2019-11-15 22:38:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 22:38:16,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:16,010 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-15 22:38:16,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:16,227 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1265222796, now seen corresponding path program 1 times [2019-11-15 22:38:16,228 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:16,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [148366150] [2019-11-15 22:38:16,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:17,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:17,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:17,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:17,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:17,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:17,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:17,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:17,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:17,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:17,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:17,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:17,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:17,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:17,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 192 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:17,551 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:17,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:17,574 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:17,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:17,575 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:17,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:17,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:17,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:17,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [148366150] [2019-11-15 22:38:17,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:17,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:17,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627761716] [2019-11-15 22:38:17,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:17,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:17,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:17,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:17,621 INFO L87 Difference]: Start difference. First operand 1414 states and 2211 transitions. Second operand 4 states. [2019-11-15 22:38:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:20,967 INFO L93 Difference]: Finished difference Result 3327 states and 5160 transitions. [2019-11-15 22:38:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:20,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-15 22:38:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:20,975 INFO L225 Difference]: With dead ends: 3327 [2019-11-15 22:38:20,975 INFO L226 Difference]: Without dead ends: 1932 [2019-11-15 22:38:20,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-15 22:38:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1414. [2019-11-15 22:38:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-15 22:38:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2181 transitions. [2019-11-15 22:38:21,032 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2181 transitions. Word has length 180 [2019-11-15 22:38:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:21,033 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2181 transitions. [2019-11-15 22:38:21,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2181 transitions. [2019-11-15 22:38:21,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 22:38:21,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:21,037 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-15 22:38:21,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:21,250 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1754216307, now seen corresponding path program 1 times [2019-11-15 22:38:21,250 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:21,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [81276819] [2019-11-15 22:38:21,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:22,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:22,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:22,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:22,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:22,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:22,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:22,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:22,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:22,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:22,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:22,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:22,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:22,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:22,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 198 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:22,525 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:22,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:22,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:22,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:22,554 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:22,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:22,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:22,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:22,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [81276819] [2019-11-15 22:38:22,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:22,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:22,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993512512] [2019-11-15 22:38:22,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:22,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:22,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:22,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:22,580 INFO L87 Difference]: Start difference. First operand 1414 states and 2181 transitions. Second operand 4 states. [2019-11-15 22:38:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:25,540 INFO L93 Difference]: Finished difference Result 3327 states and 5101 transitions. [2019-11-15 22:38:25,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:25,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-15 22:38:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:25,547 INFO L225 Difference]: With dead ends: 3327 [2019-11-15 22:38:25,547 INFO L226 Difference]: Without dead ends: 1932 [2019-11-15 22:38:25,549 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-15 22:38:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1414. [2019-11-15 22:38:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-15 22:38:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2151 transitions. [2019-11-15 22:38:25,601 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2151 transitions. Word has length 181 [2019-11-15 22:38:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:25,602 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2151 transitions. [2019-11-15 22:38:25,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2151 transitions. [2019-11-15 22:38:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 22:38:25,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:25,606 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-15 22:38:25,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:25,815 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 664544815, now seen corresponding path program 1 times [2019-11-15 22:38:25,816 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:25,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [873729530] [2019-11-15 22:38:25,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:27,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:27,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:27,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:27,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:27,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:27,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:27,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:27,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:27,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:27,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:27,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:27,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:27,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:27,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 204 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:27,212 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:27,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:27,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:27,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:27,243 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:27,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:27,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:27,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:27,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873729530] [2019-11-15 22:38:27,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:27,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:27,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931299478] [2019-11-15 22:38:27,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:27,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:27,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:27,272 INFO L87 Difference]: Start difference. First operand 1414 states and 2151 transitions. Second operand 4 states. [2019-11-15 22:38:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:30,728 INFO L93 Difference]: Finished difference Result 3327 states and 5042 transitions. [2019-11-15 22:38:30,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:30,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-15 22:38:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:30,737 INFO L225 Difference]: With dead ends: 3327 [2019-11-15 22:38:30,737 INFO L226 Difference]: Without dead ends: 1932 [2019-11-15 22:38:30,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-15 22:38:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1414. [2019-11-15 22:38:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-15 22:38:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2121 transitions. [2019-11-15 22:38:30,799 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2121 transitions. Word has length 182 [2019-11-15 22:38:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:30,800 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2121 transitions. [2019-11-15 22:38:30,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2121 transitions. [2019-11-15 22:38:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 22:38:30,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:30,804 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-15 22:38:31,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:31,014 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1265580952, now seen corresponding path program 1 times [2019-11-15 22:38:31,014 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:31,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1620515204] [2019-11-15 22:38:31,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:32,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:32,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:32,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:32,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:32,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:32,328 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:32,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 210 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:32,374 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:32,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:32,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,412 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,413 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 22:38:32,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1620515204] [2019-11-15 22:38:32,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:32,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:32,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887881089] [2019-11-15 22:38:32,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:32,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:32,433 INFO L87 Difference]: Start difference. First operand 1414 states and 2121 transitions. Second operand 4 states. [2019-11-15 22:38:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:35,407 INFO L93 Difference]: Finished difference Result 3267 states and 4905 transitions. [2019-11-15 22:38:35,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:35,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-15 22:38:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:35,415 INFO L225 Difference]: With dead ends: 3267 [2019-11-15 22:38:35,415 INFO L226 Difference]: Without dead ends: 1872 [2019-11-15 22:38:35,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-11-15 22:38:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1414. [2019-11-15 22:38:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-15 22:38:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2091 transitions. [2019-11-15 22:38:35,466 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2091 transitions. Word has length 183 [2019-11-15 22:38:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:35,467 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2091 transitions. [2019-11-15 22:38:35,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2091 transitions. [2019-11-15 22:38:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-15 22:38:35,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:35,471 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:38:35,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:35,680 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:35,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1755228501, now seen corresponding path program 1 times [2019-11-15 22:38:35,681 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:35,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [233314078] [2019-11-15 22:38:35,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:36,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:36,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:36,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:36,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:36,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:36,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:36,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:36,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:36,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:36,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:36,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:36,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:36,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:36,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 229 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:38:37,030 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:37,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:37,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:37,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:37,080 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:37,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:37,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:37,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:38:37,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [233314078] [2019-11-15 22:38:37,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:37,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:37,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868008744] [2019-11-15 22:38:37,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:37,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:37,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:37,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:37,100 INFO L87 Difference]: Start difference. First operand 1414 states and 2091 transitions. Second operand 4 states. [2019-11-15 22:38:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:39,956 INFO L93 Difference]: Finished difference Result 3459 states and 5134 transitions. [2019-11-15 22:38:39,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:39,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-15 22:38:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:39,966 INFO L225 Difference]: With dead ends: 3459 [2019-11-15 22:38:39,966 INFO L226 Difference]: Without dead ends: 2064 [2019-11-15 22:38:39,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-11-15 22:38:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1510. [2019-11-15 22:38:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-11-15 22:38:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2193 transitions. [2019-11-15 22:38:40,020 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2193 transitions. Word has length 190 [2019-11-15 22:38:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:40,020 INFO L462 AbstractCegarLoop]: Abstraction has 1510 states and 2193 transitions. [2019-11-15 22:38:40,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2193 transitions. [2019-11-15 22:38:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 22:38:40,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:40,023 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:38:40,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:40,226 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1383000558, now seen corresponding path program 1 times [2019-11-15 22:38:40,227 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:40,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [587344097] [2019-11-15 22:38:40,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:41,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:41,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:41,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:41,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:41,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:41,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:41,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:41,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:41,492 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:41,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:41,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:41,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:41,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:41,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 235 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:38:41,528 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:41,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:41,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:41,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:41,549 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:41,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:41,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:41,550 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:38:41,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [587344097] [2019-11-15 22:38:41,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:41,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:41,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139571568] [2019-11-15 22:38:41,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:41,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:41,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:41,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:41,570 INFO L87 Difference]: Start difference. First operand 1510 states and 2193 transitions. Second operand 4 states. [2019-11-15 22:38:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:45,340 INFO L93 Difference]: Finished difference Result 3459 states and 5051 transitions. [2019-11-15 22:38:45,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:45,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-15 22:38:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:45,351 INFO L225 Difference]: With dead ends: 3459 [2019-11-15 22:38:45,351 INFO L226 Difference]: Without dead ends: 1968 [2019-11-15 22:38:45,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-11-15 22:38:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1510. [2019-11-15 22:38:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-11-15 22:38:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2163 transitions. [2019-11-15 22:38:45,416 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2163 transitions. Word has length 191 [2019-11-15 22:38:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:45,417 INFO L462 AbstractCegarLoop]: Abstraction has 1510 states and 2163 transitions. [2019-11-15 22:38:45,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2163 transitions. [2019-11-15 22:38:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 22:38:45,419 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:45,419 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-15 22:38:45,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:45,620 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:45,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:45,620 INFO L82 PathProgramCache]: Analyzing trace with hash 424593642, now seen corresponding path program 1 times [2019-11-15 22:38:45,620 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:45,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1254766316] [2019-11-15 22:38:45,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:46,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:46,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:46,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:46,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:46,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:46,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:46,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:46,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:46,803 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:46,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:46,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:46,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:46,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:46,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 276 proven. 1 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-15 22:38:46,883 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:46,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:46,909 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:46,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:46,911 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:46,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:46,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:46,912 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-15 22:38:46,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1254766316] [2019-11-15 22:38:46,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:46,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:46,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250362950] [2019-11-15 22:38:46,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:46,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:46,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:46,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:46,940 INFO L87 Difference]: Start difference. First operand 1510 states and 2163 transitions. Second operand 4 states. [2019-11-15 22:38:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:50,067 INFO L93 Difference]: Finished difference Result 3597 states and 5166 transitions. [2019-11-15 22:38:50,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:50,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-15 22:38:50,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:50,075 INFO L225 Difference]: With dead ends: 3597 [2019-11-15 22:38:50,076 INFO L226 Difference]: Without dead ends: 2106 [2019-11-15 22:38:50,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-11-15 22:38:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1708. [2019-11-15 22:38:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-11-15 22:38:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2451 transitions. [2019-11-15 22:38:50,139 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2451 transitions. Word has length 198 [2019-11-15 22:38:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:50,140 INFO L462 AbstractCegarLoop]: Abstraction has 1708 states and 2451 transitions. [2019-11-15 22:38:50,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2451 transitions. [2019-11-15 22:38:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 22:38:50,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:50,142 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-15 22:38:50,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:50,342 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash 898986440, now seen corresponding path program 1 times [2019-11-15 22:38:50,343 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:50,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [551371302] [2019-11-15 22:38:50,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:51,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:51,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:51,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:51,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:51,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:51,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:51,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:51,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:51,466 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:51,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:51,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:51,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:51,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:51,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 278 proven. 1 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-15 22:38:51,516 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:51,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:51,552 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:51,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:51,554 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:51,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:51,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:51,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-15 22:38:51,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [551371302] [2019-11-15 22:38:51,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:51,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:51,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703156612] [2019-11-15 22:38:51,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:51,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:51,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:51,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:51,586 INFO L87 Difference]: Start difference. First operand 1708 states and 2451 transitions. Second operand 4 states. [2019-11-15 22:38:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:54,223 INFO L93 Difference]: Finished difference Result 3855 states and 5568 transitions. [2019-11-15 22:38:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:54,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-15 22:38:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:54,228 INFO L225 Difference]: With dead ends: 3855 [2019-11-15 22:38:54,228 INFO L226 Difference]: Without dead ends: 2166 [2019-11-15 22:38:54,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-11-15 22:38:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 1774. [2019-11-15 22:38:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1774 states. [2019-11-15 22:38:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2577 transitions. [2019-11-15 22:38:54,317 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2577 transitions. Word has length 199 [2019-11-15 22:38:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:54,317 INFO L462 AbstractCegarLoop]: Abstraction has 1774 states and 2577 transitions. [2019-11-15 22:38:54,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2577 transitions. [2019-11-15 22:38:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 22:38:54,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:54,319 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:38:54,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:54,520 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:54,520 INFO L82 PathProgramCache]: Analyzing trace with hash -842722510, now seen corresponding path program 1 times [2019-11-15 22:38:54,521 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:54,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [705596913] [2019-11-15 22:38:54,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:55,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:38:55,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:55,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:55,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:38:55,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:55,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:55,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:55,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:38:55,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:55,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:38:55,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:55,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:55,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:55,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:38:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 288 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:38:55,897 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:38:55,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:38:55,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:55,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:55,924 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:55,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:55,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:55,925 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:38:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:38:55,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [705596913] [2019-11-15 22:38:55,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:38:55,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:38:55,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983310659] [2019-11-15 22:38:55,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:38:55,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:38:55,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:38:55,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:55,953 INFO L87 Difference]: Start difference. First operand 1774 states and 2577 transitions. Second operand 4 states. [2019-11-15 22:38:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:59,183 INFO L93 Difference]: Finished difference Result 4125 states and 5976 transitions. [2019-11-15 22:38:59,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:59,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-15 22:38:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:59,188 INFO L225 Difference]: With dead ends: 4125 [2019-11-15 22:38:59,188 INFO L226 Difference]: Without dead ends: 2370 [2019-11-15 22:38:59,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-11-15 22:38:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1954. [2019-11-15 22:38:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-11-15 22:38:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2817 transitions. [2019-11-15 22:38:59,246 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2817 transitions. Word has length 204 [2019-11-15 22:38:59,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:59,247 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2817 transitions. [2019-11-15 22:38:59,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:38:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2817 transitions. [2019-11-15 22:38:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 22:38:59,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:59,249 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-15 22:38:59,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:59,450 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:38:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1080292437, now seen corresponding path program 1 times [2019-11-15 22:38:59,451 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:59,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [362385361] [2019-11-15 22:38:59,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:39:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:00,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:39:00,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:39:00,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:00,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:39:00,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:00,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:00,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:00,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:39:00,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:00,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:39:00,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:00,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:00,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:00,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:39:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 291 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:39:00,818 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:39:00,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:39:00,839 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:00,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:00,840 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:00,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:00,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:00,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:39:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:39:00,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [362385361] [2019-11-15 22:39:00,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:39:00,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:39:00,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275396952] [2019-11-15 22:39:00,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:39:00,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:39:00,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:39:00,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:39:00,868 INFO L87 Difference]: Start difference. First operand 1954 states and 2817 transitions. Second operand 4 states. [2019-11-15 22:39:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:04,235 INFO L93 Difference]: Finished difference Result 4281 states and 6168 transitions. [2019-11-15 22:39:04,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:39:04,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-11-15 22:39:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:04,239 INFO L225 Difference]: With dead ends: 4281 [2019-11-15 22:39:04,240 INFO L226 Difference]: Without dead ends: 2346 [2019-11-15 22:39:04,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:39:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-11-15 22:39:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 1954. [2019-11-15 22:39:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-11-15 22:39:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2799 transitions. [2019-11-15 22:39:04,325 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2799 transitions. Word has length 205 [2019-11-15 22:39:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:04,326 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2799 transitions. [2019-11-15 22:39:04,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:39:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2799 transitions. [2019-11-15 22:39:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-15 22:39:04,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:04,329 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:39:04,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:39:04,536 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:04,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2034535521, now seen corresponding path program 1 times [2019-11-15 22:39:04,537 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:39:04,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1778132878] [2019-11-15 22:39:04,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:39:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:06,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:39:06,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:39:06,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:06,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:39:06,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:06,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:06,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:06,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:39:06,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:06,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:39:06,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:06,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:06,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:06,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:39:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 282 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:39:06,321 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:39:06,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:39:06,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:06,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:06,377 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:06,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:06,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:06,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:39:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:39:06,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1778132878] [2019-11-15 22:39:06,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:39:06,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:39:06,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631836107] [2019-11-15 22:39:06,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:39:06,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:39:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:39:06,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:39:06,415 INFO L87 Difference]: Start difference. First operand 1954 states and 2799 transitions. Second operand 4 states. [2019-11-15 22:39:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:08,941 INFO L93 Difference]: Finished difference Result 4485 states and 6408 transitions. [2019-11-15 22:39:08,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:39:08,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-15 22:39:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:08,948 INFO L225 Difference]: With dead ends: 4485 [2019-11-15 22:39:08,948 INFO L226 Difference]: Without dead ends: 2550 [2019-11-15 22:39:08,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:39:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-11-15 22:39:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2122. [2019-11-15 22:39:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-11-15 22:39:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3009 transitions. [2019-11-15 22:39:09,041 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3009 transitions. Word has length 207 [2019-11-15 22:39:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:09,041 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 3009 transitions. [2019-11-15 22:39:09,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:39:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3009 transitions. [2019-11-15 22:39:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-15 22:39:09,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:09,045 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:39:09,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:39:09,261 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2041947110, now seen corresponding path program 1 times [2019-11-15 22:39:09,262 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:39:09,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [156063907] [2019-11-15 22:39:09,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:39:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:10,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:39:10,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:39:10,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:10,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:39:10,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:11,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:11,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:11,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:39:11,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:11,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:39:11,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:11,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:11,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:11,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:39:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 285 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:39:11,108 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:39:11,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 22:39:11,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:11,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:11,150 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:11,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:11,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:11,151 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 22:39:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 22:39:11,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [156063907] [2019-11-15 22:39:11,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:39:11,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:39:11,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088863679] [2019-11-15 22:39:11,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:39:11,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:39:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:39:11,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:39:11,188 INFO L87 Difference]: Start difference. First operand 2122 states and 3009 transitions. Second operand 4 states. [2019-11-15 22:39:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:39:14,270 INFO L93 Difference]: Finished difference Result 4617 states and 6552 transitions. [2019-11-15 22:39:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:39:14,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-15 22:39:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:39:14,275 INFO L225 Difference]: With dead ends: 4617 [2019-11-15 22:39:14,275 INFO L226 Difference]: Without dead ends: 2514 [2019-11-15 22:39:14,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:39:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2019-11-15 22:39:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2122. [2019-11-15 22:39:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-11-15 22:39:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2985 transitions. [2019-11-15 22:39:14,370 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2985 transitions. Word has length 208 [2019-11-15 22:39:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:39:14,371 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 2985 transitions. [2019-11-15 22:39:14,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:39:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2985 transitions. [2019-11-15 22:39:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-15 22:39:14,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:39:14,374 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 22:39:14,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:39:14,590 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:39:14,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:39:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1047950778, now seen corresponding path program 1 times [2019-11-15 22:39:14,591 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:39:14,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1861082379] [2019-11-15 22:39:14,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c473c216-7858-4122-af9d-18722c69793e/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:39:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:39:16,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 22:39:16,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:39:17,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:17,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 22:39:17,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:20,019 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 22:39:20,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:20,021 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_288|, |v_#memory_$Pointer$.offset_288|], 2=[|v_#memory_$Pointer$.base_284|, |v_#memory_$Pointer$.offset_284|, |v_#memory_$Pointer$.offset_285|, |v_#memory_$Pointer$.base_285|]} [2019-11-15 22:39:20,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:20,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:20,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:20,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:20,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:20,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:20,735 INFO L235 Elim1Store]: Index analysis took 609 ms [2019-11-15 22:39:21,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 22:39:21,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:23,973 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 22:39:23,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:24,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:24,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:24,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:24,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:24,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:24,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:24,288 INFO L235 Elim1Store]: Index analysis took 262 ms [2019-11-15 22:39:24,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 22:39:24,551 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:25,498 WARN L191 SmtUtils]: Spent 946.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 22:39:25,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:25,510 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:26,038 WARN L191 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-15 22:39:26,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:26,049 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:26,444 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 22:39:26,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:26,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-15 22:39:26,541 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:26,770 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 22:39:26,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:26,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-15 22:39:26,791 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:26,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:26,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:26,854 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:170, output treesize:65 [2019-11-15 22:39:26,878 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_289|], 12=[|v_#memory_$Pointer$.base_289|]} [2019-11-15 22:39:26,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:39:26,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:26,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:26,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:39:26,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:26,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:26,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:26,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 22:39:26,967 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_290|], 12=[|v_#memory_$Pointer$.base_290|]} [2019-11-15 22:39:26,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:26,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:39:26,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:39:27,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 22:39:27,063 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_291|, |v_#memory_$Pointer$.offset_286|, |v_#memory_$Pointer$.base_286|], 12=[|v_#memory_$Pointer$.base_291|]} [2019-11-15 22:39:27,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:39:27,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,363 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 22:39:27,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:39:27,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,503 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-15 22:39:27,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,506 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:27,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 22:39:27,599 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,622 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:65 [2019-11-15 22:39:27,630 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_292|], 12=[|v_#memory_$Pointer$.base_292|]} [2019-11-15 22:39:27,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:39:27,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:39:27,700 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 22:39:27,721 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_293|], 12=[|v_#memory_$Pointer$.base_293|]} [2019-11-15 22:39:27,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 22:39:27,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:39:27,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 22:39:27,810 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_294|], 20=[|v_#memory_$Pointer$.base_294|]} [2019-11-15 22:39:27,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 95 [2019-11-15 22:39:27,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:27,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:27,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:27,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:28,151 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-15 22:39:28,152 INFO L341 Elim1Store]: treesize reduction 64, result has 73.9 percent of original size [2019-11-15 22:39:28,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 245 [2019-11-15 22:39:28,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:39:28,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:28,231 INFO L496 ElimStorePlain]: Start of recursive call 3: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 7 xjuncts. [2019-11-15 22:39:29,425 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 193 DAG size of output: 148 [2019-11-15 22:39:29,425 INFO L567 ElimStorePlain]: treesize reduction 788, result has 57.9 percent of original size [2019-11-15 22:39:29,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:29,427 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:1228 [2019-11-15 22:39:29,636 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-11-15 22:39:29,639 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_287|, |v_#memory_$Pointer$.base_287|], 20=[|v_#memory_$Pointer$.offset_295|], 30=[|v_#memory_$Pointer$.base_295|]} [2019-11-15 22:39:29,654 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:30,196 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 22:39:30,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:30,205 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:30,416 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-15 22:39:30,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:30,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 97 [2019-11-15 22:39:30,471 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:30,686 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 22:39:30,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:30,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:30,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,156 WARN L191 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-15 22:39:37,157 INFO L341 Elim1Store]: treesize reduction 57, result has 75.8 percent of original size [2019-11-15 22:39:37,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 155 treesize of output 282 [2019-11-15 22:39:37,158 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:37,298 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-11-15 22:39:37,298 INFO L567 ElimStorePlain]: treesize reduction 249, result has 39.3 percent of original size [2019-11-15 22:39:37,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:37,298 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:219, output treesize:143 [2019-11-15 22:39:37,311 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_296|], 30=[|v_#memory_$Pointer$.base_296|]} [2019-11-15 22:39:37,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 88 [2019-11-15 22:39:37,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:37,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:37,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:37,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:43,763 WARN L191 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-11-15 22:39:43,764 INFO L341 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-15 22:39:43,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 134 treesize of output 198 [2019-11-15 22:39:43,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:43,859 INFO L567 ElimStorePlain]: treesize reduction 156, result has 44.9 percent of original size [2019-11-15 22:39:43,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:43,859 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:181, output treesize:127 [2019-11-15 22:39:43,874 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_323|], 20=[|v_#memory_$Pointer$.offset_297|], 30=[|v_#memory_$Pointer$.base_297|]} [2019-11-15 22:39:43,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-11-15 22:39:43,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:43,994 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 22:39:43,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:44,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,028 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:44,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 204 [2019-11-15 22:39:44,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:44,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:44,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,241 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 22:39:44,241 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:44,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 161 treesize of output 250 [2019-11-15 22:39:44,243 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:44,353 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-11-15 22:39:44,353 INFO L567 ElimStorePlain]: treesize reduction 220, result has 38.9 percent of original size [2019-11-15 22:39:44,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:44,353 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:272, output treesize:140 [2019-11-15 22:39:44,412 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_324|], 20=[|v_#memory_$Pointer$.offset_298|], 30=[|v_#memory_$Pointer$.base_298|]} [2019-11-15 22:39:44,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-15 22:39:44,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:44,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:44,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2019-11-15 22:39:44,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:44,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:44,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:44,865 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-11-15 22:39:44,865 INFO L341 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-15 22:39:44,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 205 [2019-11-15 22:39:44,867 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:44,974 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-11-15 22:39:44,974 INFO L567 ElimStorePlain]: treesize reduction 156, result has 48.9 percent of original size [2019-11-15 22:39:44,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:44,974 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:191, output treesize:149 [2019-11-15 22:39:45,044 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_int_325|, |v_#memory_$Pointer$.offset_299|], 20=[|v_#memory_$Pointer$.base_299|]} [2019-11-15 22:39:45,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:45,063 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:39:45,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2019-11-15 22:39:45,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:45,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:45,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:45,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 73 [2019-11-15 22:39:45,132 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:45,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:45,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:45,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:45,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:45,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:45,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:45,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:39:45,263 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:45,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 110 treesize of output 108 [2019-11-15 22:39:45,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:45,274 INFO L496 ElimStorePlain]: Start of recursive call 4: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 5 xjuncts. [2019-11-15 22:39:45,602 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 87 [2019-11-15 22:39:45,603 INFO L567 ElimStorePlain]: treesize reduction 128, result has 59.6 percent of original size [2019-11-15 22:39:45,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:45,604 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:180, output treesize:149 [2019-11-15 22:39:45,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2019-11-15 22:39:45,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:45,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:45,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:39:45,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:3 [2019-11-15 22:39:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 299 proven. 79 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:39:46,190 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:39:46,286 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:46,322 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:46,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,328 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:44 [2019-11-15 22:39:46,376 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_304|, |v_#memory_$Pointer$.base_304|], 2=[|#memory_int|]} [2019-11-15 22:39:46,383 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:46,479 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:46,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 195 [2019-11-15 22:39:46,503 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:39:46,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:46,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:46,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:46,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,577 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:201, output treesize:191 [2019-11-15 22:39:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:46,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:46,672 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,688 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,709 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,724 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,981 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-11-15 22:39:46,981 INFO L567 ElimStorePlain]: treesize reduction 336, result has 42.0 percent of original size [2019-11-15 22:39:46,987 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:46,992 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:47,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:47,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-11-15 22:39:47,050 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:529, output treesize:257 [2019-11-15 22:39:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:47,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:48,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:49,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:50,763 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_287|, |v_#memory_$Pointer$.base_287|], 6=[|v_#memory_$Pointer$.offset_306|, |v_#memory_$Pointer$.base_306|]} [2019-11-15 22:39:50,790 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:50,864 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:50,896 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:50,925 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:53,419 WARN L191 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-11-15 22:39:53,420 INFO L567 ElimStorePlain]: treesize reduction 42, result has 93.3 percent of original size [2019-11-15 22:39:53,437 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:53,461 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:53,487 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:53,506 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:54,538 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-15 22:39:54,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:54,551 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:54,566 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:54,608 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:54,621 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:55,806 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 122 [2019-11-15 22:39:55,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:55,821 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:55,835 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:55,852 INFO L496 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:55,863 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:56,165 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 60 [2019-11-15 22:39:56,165 INFO L567 ElimStorePlain]: treesize reduction 444, result has 43.5 percent of original size [2019-11-15 22:39:56,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-11-15 22:39:56,166 INFO L221 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:689, output treesize:342 [2019-11-15 22:39:56,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:56,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:56,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:56,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:56,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:56,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:39:56,766 INFO L392 ElimStorePlain]: Different costs {21=[|v_#memory_$Pointer$.offset_308|], 41=[|v_#memory_$Pointer$.base_308|]} [2019-11-15 22:39:56,771 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:56,971 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-15 22:39:56,971 INFO L567 ElimStorePlain]: treesize reduction 352, result has 55.3 percent of original size [2019-11-15 22:39:56,972 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:57,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:39:57,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:39:57,032 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:637, output treesize:654 [2019-11-15 22:39:58,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:39:58,246 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:39:58,249 INFO L168 Benchmark]: Toolchain (without parser) took 146783.46 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.7 MB). Free memory was 945.6 MB in the beginning and 975.6 MB in the end (delta: -30.0 MB). Peak memory consumption was 416.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:58,250 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:39:58,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 883.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:58,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:58,251 INFO L168 Benchmark]: Boogie Preprocessor took 84.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:58,251 INFO L168 Benchmark]: RCFGBuilder took 3826.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.1 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:58,251 INFO L168 Benchmark]: TraceAbstraction took 141859.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 281.5 MB). Free memory was 1.0 GB in the beginning and 975.6 MB in the end (delta: 48.0 MB). Peak memory consumption was 329.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:39:58,253 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 883.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3826.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.1 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 141859.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 281.5 MB). Free memory was 1.0 GB in the beginning and 975.6 MB in the end (delta: 48.0 MB). Peak memory consumption was 329.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...