./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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 e83cf3c2949f89871817218ec6b0742e2a7cf269 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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 e83cf3c2949f89871817218ec6b0742e2a7cf269 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-20 02:05:01,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:05:01,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:05:01,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:05:01,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:05:01,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:05:01,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:05:01,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:05:01,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:05:01,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:05:01,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:05:01,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:05:01,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:05:01,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:05:01,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:05:01,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:05:01,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:05:01,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:05:01,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:05:01,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:05:01,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:05:01,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:05:01,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:05:01,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:05:01,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:05:01,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:05:01,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:05:01,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:05:01,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:05:01,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:05:01,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:05:01,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:05:01,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:05:01,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:05:01,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:05:01,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:05:01,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:05:01,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:05:01,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:05:01,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:05:01,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:05:01,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:05:01,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:05:01,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:05:01,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:05:01,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:05:01,482 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:05:01,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:05:01,482 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:05:01,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:05:01,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:05:01,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:05:01,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:05:01,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:05:01,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:05:01,488 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:05:01,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:05:01,488 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:05:01,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:05:01,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:05:01,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:05:01,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:05:01,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:05:01,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:05:01,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:05:01,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:05:01,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:05:01,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:05:01,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:05:01,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:05:01,491 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_8f698512-62a9-47be-8268-1e81b45f119d/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 -> e83cf3c2949f89871817218ec6b0742e2a7cf269 [2019-11-20 02:05:01,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:05:01,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:05:01,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:05:01,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:05:01,637 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:05:01,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-11-20 02:05:01,693 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data/a079f9147/cd75a422560a4c5d849ef6e7d9f61bb7/FLAGc517e14ba [2019-11-20 02:05:02,206 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:05:02,209 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-11-20 02:05:02,233 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data/a079f9147/cd75a422560a4c5d849ef6e7d9f61bb7/FLAGc517e14ba [2019-11-20 02:05:02,657 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data/a079f9147/cd75a422560a4c5d849ef6e7d9f61bb7 [2019-11-20 02:05:02,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:05:02,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:05:02,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:05:02,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:05:02,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:05:02,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:05:02" (1/1) ... [2019-11-20 02:05:02,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3409c829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:02, skipping insertion in model container [2019-11-20 02:05:02,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:05:02" (1/1) ... [2019-11-20 02:05:02,671 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:05:02,730 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:05:03,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:05:03,339 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:05:03,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:05:03,463 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:05:03,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03 WrapperNode [2019-11-20 02:05:03,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:05:03,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:05:03,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:05:03,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:05:03,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... [2019-11-20 02:05:03,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... [2019-11-20 02:05:03,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:05:03,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:05:03,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:05:03,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:05:03,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... [2019-11-20 02:05:03,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... [2019-11-20 02:05:03,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... [2019-11-20 02:05:03,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... [2019-11-20 02:05:03,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... [2019-11-20 02:05:03,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... [2019-11-20 02:05:03,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... [2019-11-20 02:05:03,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:05:03,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:05:03,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:05:03,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:05:03,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:05:03,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 02:05:03,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:05:03,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 02:05:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 02:05:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 02:05:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 02:05:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:05:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:05:04,033 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:05:05,176 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 02:05:05,177 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 02:05:05,178 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:05:05,178 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 02:05:05,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:05:05 BoogieIcfgContainer [2019-11-20 02:05:05,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:05:05,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:05:05,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:05:05,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:05:05,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:05:02" (1/3) ... [2019-11-20 02:05:05,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa55d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:05:05, skipping insertion in model container [2019-11-20 02:05:05,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:05:03" (2/3) ... [2019-11-20 02:05:05,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa55d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:05:05, skipping insertion in model container [2019-11-20 02:05:05,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:05:05" (3/3) ... [2019-11-20 02:05:05,187 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2019-11-20 02:05:05,196 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:05:05,204 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:05:05,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:05:05,242 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:05:05,242 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:05:05,242 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:05:05,242 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:05:05,243 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:05:05,243 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:05:05,243 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:05:05,243 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:05:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-20 02:05:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 02:05:05,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:05,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:05,274 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:05,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:05,280 INFO L82 PathProgramCache]: Analyzing trace with hash 557483936, now seen corresponding path program 1 times [2019-11-20 02:05:05,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:05,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808489499] [2019-11-20 02:05:05,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:05:05,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808489499] [2019-11-20 02:05:05,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:05,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:05,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103817675] [2019-11-20 02:05:05,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:05,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:05,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:05,603 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-11-20 02:05:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:06,169 INFO L93 Difference]: Finished difference Result 329 states and 559 transitions. [2019-11-20 02:05:06,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:06,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-20 02:05:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:06,184 INFO L225 Difference]: With dead ends: 329 [2019-11-20 02:05:06,185 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 02:05:06,189 INFO L630 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-20 02:05:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 02:05:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-11-20 02:05:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 02:05:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2019-11-20 02:05:06,237 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 42 [2019-11-20 02:05:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:06,238 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2019-11-20 02:05:06,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2019-11-20 02:05:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 02:05:06,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:06,242 INFO L410 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] [2019-11-20 02:05:06,242 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1960137762, now seen corresponding path program 1 times [2019-11-20 02:05:06,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:06,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342533936] [2019-11-20 02:05:06,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:06,374 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-20 02:05:06,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342533936] [2019-11-20 02:05:06,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:06,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:06,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472308558] [2019-11-20 02:05:06,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:06,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:06,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:06,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:06,378 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand 4 states. [2019-11-20 02:05:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:06,852 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2019-11-20 02:05:06,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:06,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-20 02:05:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:06,855 INFO L225 Difference]: With dead ends: 296 [2019-11-20 02:05:06,855 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 02:05:06,856 INFO L630 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-20 02:05:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 02:05:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-11-20 02:05:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 02:05:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 231 transitions. [2019-11-20 02:05:06,872 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 231 transitions. Word has length 55 [2019-11-20 02:05:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:06,872 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 231 transitions. [2019-11-20 02:05:06,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 231 transitions. [2019-11-20 02:05:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 02:05:06,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:06,876 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:06,876 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:06,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1719614288, now seen corresponding path program 1 times [2019-11-20 02:05:06,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:06,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255024049] [2019-11-20 02:05:06,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:07,004 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-20 02:05:07,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255024049] [2019-11-20 02:05:07,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:07,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:07,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110113340] [2019-11-20 02:05:07,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:07,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:07,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:07,007 INFO L87 Difference]: Start difference. First operand 149 states and 231 transitions. Second operand 4 states. [2019-11-20 02:05:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:07,439 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2019-11-20 02:05:07,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:07,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 02:05:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:07,441 INFO L225 Difference]: With dead ends: 295 [2019-11-20 02:05:07,441 INFO L226 Difference]: Without dead ends: 165 [2019-11-20 02:05:07,443 INFO L630 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-20 02:05:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-20 02:05:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-11-20 02:05:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 02:05:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 230 transitions. [2019-11-20 02:05:07,461 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 230 transitions. Word has length 56 [2019-11-20 02:05:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:07,461 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 230 transitions. [2019-11-20 02:05:07,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2019-11-20 02:05:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 02:05:07,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:07,464 INFO L410 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] [2019-11-20 02:05:07,464 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash 857090501, now seen corresponding path program 1 times [2019-11-20 02:05:07,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:07,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22441823] [2019-11-20 02:05:07,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:07,599 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-20 02:05:07,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22441823] [2019-11-20 02:05:07,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:07,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:07,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635701330] [2019-11-20 02:05:07,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:07,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:07,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:07,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:07,603 INFO L87 Difference]: Start difference. First operand 149 states and 230 transitions. Second operand 4 states. [2019-11-20 02:05:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:08,015 INFO L93 Difference]: Finished difference Result 293 states and 450 transitions. [2019-11-20 02:05:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:08,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 02:05:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:08,017 INFO L225 Difference]: With dead ends: 293 [2019-11-20 02:05:08,017 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 02:05:08,018 INFO L630 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-20 02:05:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 02:05:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2019-11-20 02:05:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 02:05:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 229 transitions. [2019-11-20 02:05:08,036 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 229 transitions. Word has length 56 [2019-11-20 02:05:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:08,037 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 229 transitions. [2019-11-20 02:05:08,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 229 transitions. [2019-11-20 02:05:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 02:05:08,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:08,045 INFO L410 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] [2019-11-20 02:05:08,046 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:08,046 INFO L82 PathProgramCache]: Analyzing trace with hash -463762811, now seen corresponding path program 1 times [2019-11-20 02:05:08,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:08,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304838619] [2019-11-20 02:05:08,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:08,170 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-20 02:05:08,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304838619] [2019-11-20 02:05:08,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:08,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:08,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250298540] [2019-11-20 02:05:08,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:08,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:08,172 INFO L87 Difference]: Start difference. First operand 149 states and 229 transitions. Second operand 4 states. [2019-11-20 02:05:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:08,547 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2019-11-20 02:05:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:08,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 02:05:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:08,549 INFO L225 Difference]: With dead ends: 292 [2019-11-20 02:05:08,550 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 02:05:08,550 INFO L630 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-20 02:05:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 02:05:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-20 02:05:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 02:05:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2019-11-20 02:05:08,563 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 56 [2019-11-20 02:05:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:08,563 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2019-11-20 02:05:08,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2019-11-20 02:05:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 02:05:08,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:08,565 INFO L410 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] [2019-11-20 02:05:08,565 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash 672103484, now seen corresponding path program 1 times [2019-11-20 02:05:08,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:08,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89595730] [2019-11-20 02:05:08,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:08,650 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-20 02:05:08,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89595730] [2019-11-20 02:05:08,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:08,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:08,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444174195] [2019-11-20 02:05:08,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:08,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:08,654 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand 4 states. [2019-11-20 02:05:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:08,992 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2019-11-20 02:05:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:08,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 02:05:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:08,994 INFO L225 Difference]: With dead ends: 292 [2019-11-20 02:05:08,994 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 02:05:08,995 INFO L630 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-20 02:05:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 02:05:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-20 02:05:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 02:05:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 227 transitions. [2019-11-20 02:05:09,010 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 227 transitions. Word has length 56 [2019-11-20 02:05:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:09,014 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 227 transitions. [2019-11-20 02:05:09,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 227 transitions. [2019-11-20 02:05:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 02:05:09,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:09,015 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:09,016 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:09,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:09,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1092203463, now seen corresponding path program 1 times [2019-11-20 02:05:09,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:09,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919020257] [2019-11-20 02:05:09,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:09,091 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-20 02:05:09,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919020257] [2019-11-20 02:05:09,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:09,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:09,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864111341] [2019-11-20 02:05:09,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:09,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:09,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:09,093 INFO L87 Difference]: Start difference. First operand 149 states and 227 transitions. Second operand 4 states. [2019-11-20 02:05:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:09,389 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2019-11-20 02:05:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:09,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 02:05:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:09,391 INFO L225 Difference]: With dead ends: 292 [2019-11-20 02:05:09,391 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 02:05:09,391 INFO L630 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-20 02:05:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 02:05:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-20 02:05:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 02:05:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2019-11-20 02:05:09,397 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 57 [2019-11-20 02:05:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:09,397 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2019-11-20 02:05:09,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2019-11-20 02:05:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 02:05:09,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:09,398 INFO L410 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] [2019-11-20 02:05:09,399 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:09,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:09,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1572913161, now seen corresponding path program 1 times [2019-11-20 02:05:09,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:09,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132113963] [2019-11-20 02:05:09,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:09,452 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-20 02:05:09,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132113963] [2019-11-20 02:05:09,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:09,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:09,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664157412] [2019-11-20 02:05:09,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:09,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:09,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:09,455 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2019-11-20 02:05:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:09,787 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2019-11-20 02:05:09,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:09,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 02:05:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:09,789 INFO L225 Difference]: With dead ends: 292 [2019-11-20 02:05:09,789 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 02:05:09,790 INFO L630 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-20 02:05:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 02:05:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-20 02:05:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 02:05:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2019-11-20 02:05:09,795 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 58 [2019-11-20 02:05:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:09,795 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2019-11-20 02:05:09,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2019-11-20 02:05:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 02:05:09,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:09,796 INFO L410 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] [2019-11-20 02:05:09,797 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash -916813804, now seen corresponding path program 1 times [2019-11-20 02:05:09,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:09,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131448382] [2019-11-20 02:05:09,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:09,857 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-20 02:05:09,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131448382] [2019-11-20 02:05:09,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:09,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:09,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111503369] [2019-11-20 02:05:09,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:09,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:09,859 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 4 states. [2019-11-20 02:05:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:10,116 INFO L93 Difference]: Finished difference Result 282 states and 431 transitions. [2019-11-20 02:05:10,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:10,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 02:05:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:10,117 INFO L225 Difference]: With dead ends: 282 [2019-11-20 02:05:10,118 INFO L226 Difference]: Without dead ends: 152 [2019-11-20 02:05:10,118 INFO L630 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-20 02:05:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-20 02:05:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2019-11-20 02:05:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 02:05:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-11-20 02:05:10,123 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 59 [2019-11-20 02:05:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:10,124 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-11-20 02:05:10,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-11-20 02:05:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 02:05:10,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:10,125 INFO L410 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] [2019-11-20 02:05:10,125 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:10,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:10,125 INFO L82 PathProgramCache]: Analyzing trace with hash -243814996, now seen corresponding path program 1 times [2019-11-20 02:05:10,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:10,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154161096] [2019-11-20 02:05:10,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:10,219 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-20 02:05:10,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154161096] [2019-11-20 02:05:10,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:10,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:10,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863898969] [2019-11-20 02:05:10,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:10,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:10,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:10,224 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 4 states. [2019-11-20 02:05:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:10,596 INFO L93 Difference]: Finished difference Result 322 states and 492 transitions. [2019-11-20 02:05:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:10,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 02:05:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:10,599 INFO L225 Difference]: With dead ends: 322 [2019-11-20 02:05:10,599 INFO L226 Difference]: Without dead ends: 192 [2019-11-20 02:05:10,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-20 02:05:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-11-20 02:05:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 02:05:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2019-11-20 02:05:10,606 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 59 [2019-11-20 02:05:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:10,607 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2019-11-20 02:05:10,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2019-11-20 02:05:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 02:05:10,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:10,608 INFO L410 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] [2019-11-20 02:05:10,608 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash 839606678, now seen corresponding path program 1 times [2019-11-20 02:05:10,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:10,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257538063] [2019-11-20 02:05:10,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:10,664 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-20 02:05:10,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257538063] [2019-11-20 02:05:10,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:10,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:10,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364025141] [2019-11-20 02:05:10,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:10,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:10,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:10,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:10,667 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand 4 states. [2019-11-20 02:05:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:10,960 INFO L93 Difference]: Finished difference Result 344 states and 529 transitions. [2019-11-20 02:05:10,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:10,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-20 02:05:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:10,962 INFO L225 Difference]: With dead ends: 344 [2019-11-20 02:05:10,962 INFO L226 Difference]: Without dead ends: 192 [2019-11-20 02:05:10,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-20 02:05:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-11-20 02:05:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 02:05:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2019-11-20 02:05:10,968 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2019-11-20 02:05:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:10,969 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2019-11-20 02:05:10,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2019-11-20 02:05:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 02:05:10,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:10,970 INFO L410 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] [2019-11-20 02:05:10,970 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:10,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1342889052, now seen corresponding path program 1 times [2019-11-20 02:05:10,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:10,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083840794] [2019-11-20 02:05:10,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:11,019 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-20 02:05:11,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083840794] [2019-11-20 02:05:11,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:11,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:11,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250419372] [2019-11-20 02:05:11,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:11,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:11,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:11,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:11,021 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand 4 states. [2019-11-20 02:05:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:11,275 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2019-11-20 02:05:11,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:11,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 02:05:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:11,276 INFO L225 Difference]: With dead ends: 343 [2019-11-20 02:05:11,277 INFO L226 Difference]: Without dead ends: 191 [2019-11-20 02:05:11,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-20 02:05:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2019-11-20 02:05:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 02:05:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2019-11-20 02:05:11,285 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 73 [2019-11-20 02:05:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:11,285 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2019-11-20 02:05:11,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2019-11-20 02:05:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 02:05:11,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:11,286 INFO L410 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] [2019-11-20 02:05:11,286 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 480365265, now seen corresponding path program 1 times [2019-11-20 02:05:11,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:11,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790150392] [2019-11-20 02:05:11,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:11,349 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-20 02:05:11,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790150392] [2019-11-20 02:05:11,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:11,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:11,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491649492] [2019-11-20 02:05:11,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:11,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:11,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:11,352 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand 4 states. [2019-11-20 02:05:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:11,736 INFO L93 Difference]: Finished difference Result 341 states and 522 transitions. [2019-11-20 02:05:11,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:11,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 02:05:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:11,739 INFO L225 Difference]: With dead ends: 341 [2019-11-20 02:05:11,739 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 02:05:11,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 02:05:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2019-11-20 02:05:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 02:05:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2019-11-20 02:05:11,748 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 73 [2019-11-20 02:05:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:11,748 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2019-11-20 02:05:11,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2019-11-20 02:05:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 02:05:11,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:11,750 INFO L410 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] [2019-11-20 02:05:11,750 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:11,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:11,751 INFO L82 PathProgramCache]: Analyzing trace with hash -840488047, now seen corresponding path program 1 times [2019-11-20 02:05:11,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:11,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438217116] [2019-11-20 02:05:11,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:11,823 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-20 02:05:11,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438217116] [2019-11-20 02:05:11,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:11,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:11,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692442389] [2019-11-20 02:05:11,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:11,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:11,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:11,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:11,827 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand 4 states. [2019-11-20 02:05:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:12,174 INFO L93 Difference]: Finished difference Result 340 states and 519 transitions. [2019-11-20 02:05:12,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:12,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 02:05:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:12,176 INFO L225 Difference]: With dead ends: 340 [2019-11-20 02:05:12,176 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 02:05:12,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 02:05:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-20 02:05:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 02:05:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2019-11-20 02:05:12,182 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 73 [2019-11-20 02:05:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:12,182 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2019-11-20 02:05:12,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2019-11-20 02:05:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 02:05:12,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:12,183 INFO L410 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] [2019-11-20 02:05:12,184 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash 295378248, now seen corresponding path program 1 times [2019-11-20 02:05:12,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:12,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821308830] [2019-11-20 02:05:12,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:12,239 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-20 02:05:12,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821308830] [2019-11-20 02:05:12,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:12,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:12,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045266936] [2019-11-20 02:05:12,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:12,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:12,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:12,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:12,242 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand 4 states. [2019-11-20 02:05:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:12,587 INFO L93 Difference]: Finished difference Result 340 states and 517 transitions. [2019-11-20 02:05:12,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:12,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 02:05:12,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:12,589 INFO L225 Difference]: With dead ends: 340 [2019-11-20 02:05:12,589 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 02:05:12,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 02:05:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-20 02:05:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 02:05:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2019-11-20 02:05:12,595 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 73 [2019-11-20 02:05:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:12,595 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2019-11-20 02:05:12,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2019-11-20 02:05:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 02:05:12,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:12,597 INFO L410 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] [2019-11-20 02:05:12,597 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:12,598 INFO L82 PathProgramCache]: Analyzing trace with hash 114216109, now seen corresponding path program 1 times [2019-11-20 02:05:12,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:12,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325742315] [2019-11-20 02:05:12,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:12,641 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-20 02:05:12,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325742315] [2019-11-20 02:05:12,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:12,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:12,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663441982] [2019-11-20 02:05:12,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:12,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:12,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:12,644 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand 4 states. [2019-11-20 02:05:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:13,033 INFO L93 Difference]: Finished difference Result 340 states and 515 transitions. [2019-11-20 02:05:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:13,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 02:05:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:13,035 INFO L225 Difference]: With dead ends: 340 [2019-11-20 02:05:13,035 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 02:05:13,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 02:05:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-20 02:05:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 02:05:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2019-11-20 02:05:13,042 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 74 [2019-11-20 02:05:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:13,042 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2019-11-20 02:05:13,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2019-11-20 02:05:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 02:05:13,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:13,044 INFO L410 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] [2019-11-20 02:05:13,044 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:13,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1466355203, now seen corresponding path program 1 times [2019-11-20 02:05:13,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:13,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854608155] [2019-11-20 02:05:13,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:13,104 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-20 02:05:13,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854608155] [2019-11-20 02:05:13,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:13,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:13,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350113492] [2019-11-20 02:05:13,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:13,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:13,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:13,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:13,107 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand 4 states. [2019-11-20 02:05:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:13,471 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2019-11-20 02:05:13,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:13,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 02:05:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:13,476 INFO L225 Difference]: With dead ends: 340 [2019-11-20 02:05:13,476 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 02:05:13,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 02:05:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-20 02:05:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 02:05:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2019-11-20 02:05:13,482 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 75 [2019-11-20 02:05:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:13,483 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2019-11-20 02:05:13,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2019-11-20 02:05:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 02:05:13,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:13,484 INFO L410 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] [2019-11-20 02:05:13,484 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1188775032, now seen corresponding path program 1 times [2019-11-20 02:05:13,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:13,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554923461] [2019-11-20 02:05:13,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:13,536 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-20 02:05:13,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554923461] [2019-11-20 02:05:13,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:13,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:13,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085057106] [2019-11-20 02:05:13,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:13,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:13,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:13,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:13,538 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand 4 states. [2019-11-20 02:05:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:13,903 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-20 02:05:13,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:13,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 02:05:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:13,906 INFO L225 Difference]: With dead ends: 330 [2019-11-20 02:05:13,906 INFO L226 Difference]: Without dead ends: 178 [2019-11-20 02:05:13,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-20 02:05:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2019-11-20 02:05:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 02:05:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2019-11-20 02:05:13,912 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 254 transitions. Word has length 76 [2019-11-20 02:05:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:13,912 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 254 transitions. [2019-11-20 02:05:13,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2019-11-20 02:05:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:05:13,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:13,916 INFO L410 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] [2019-11-20 02:05:13,917 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash 328017922, now seen corresponding path program 1 times [2019-11-20 02:05:13,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:13,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63393081] [2019-11-20 02:05:13,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:14,019 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-20 02:05:14,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63393081] [2019-11-20 02:05:14,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:14,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:14,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569039933] [2019-11-20 02:05:14,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:14,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:14,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:14,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:14,023 INFO L87 Difference]: Start difference. First operand 171 states and 254 transitions. Second operand 4 states. [2019-11-20 02:05:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:14,664 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2019-11-20 02:05:14,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:14,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-20 02:05:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:14,667 INFO L225 Difference]: With dead ends: 433 [2019-11-20 02:05:14,667 INFO L226 Difference]: Without dead ends: 281 [2019-11-20 02:05:14,668 INFO L630 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-20 02:05:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-20 02:05:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 212. [2019-11-20 02:05:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-20 02:05:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 328 transitions. [2019-11-20 02:05:14,677 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 328 transitions. Word has length 81 [2019-11-20 02:05:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:14,678 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 328 transitions. [2019-11-20 02:05:14,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 328 transitions. [2019-11-20 02:05:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:05:14,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:14,679 INFO L410 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] [2019-11-20 02:05:14,680 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:14,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1043789376, now seen corresponding path program 1 times [2019-11-20 02:05:14,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:14,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437995381] [2019-11-20 02:05:14,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:14,780 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-20 02:05:14,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437995381] [2019-11-20 02:05:14,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:14,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:14,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927741566] [2019-11-20 02:05:14,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:14,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:14,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:14,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:14,783 INFO L87 Difference]: Start difference. First operand 212 states and 328 transitions. Second operand 4 states. [2019-11-20 02:05:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:15,173 INFO L93 Difference]: Finished difference Result 455 states and 711 transitions. [2019-11-20 02:05:15,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:15,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-20 02:05:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:15,175 INFO L225 Difference]: With dead ends: 455 [2019-11-20 02:05:15,176 INFO L226 Difference]: Without dead ends: 262 [2019-11-20 02:05:15,176 INFO L630 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-20 02:05:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-20 02:05:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 236. [2019-11-20 02:05:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-20 02:05:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 370 transitions. [2019-11-20 02:05:15,184 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 370 transitions. Word has length 81 [2019-11-20 02:05:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:15,185 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 370 transitions. [2019-11-20 02:05:15,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 370 transitions. [2019-11-20 02:05:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 02:05:15,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:15,186 INFO L410 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] [2019-11-20 02:05:15,187 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1337426848, now seen corresponding path program 1 times [2019-11-20 02:05:15,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:15,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238107192] [2019-11-20 02:05:15,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:15,270 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-20 02:05:15,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238107192] [2019-11-20 02:05:15,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:15,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:15,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053276831] [2019-11-20 02:05:15,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:15,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:15,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:15,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:15,272 INFO L87 Difference]: Start difference. First operand 236 states and 370 transitions. Second operand 4 states. [2019-11-20 02:05:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:15,807 INFO L93 Difference]: Finished difference Result 515 states and 805 transitions. [2019-11-20 02:05:15,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:15,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-20 02:05:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:15,810 INFO L225 Difference]: With dead ends: 515 [2019-11-20 02:05:15,810 INFO L226 Difference]: Without dead ends: 298 [2019-11-20 02:05:15,810 INFO L630 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-20 02:05:15,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-20 02:05:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 237. [2019-11-20 02:05:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 02:05:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 371 transitions. [2019-11-20 02:05:15,819 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 371 transitions. Word has length 82 [2019-11-20 02:05:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:15,819 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 371 transitions. [2019-11-20 02:05:15,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 371 transitions. [2019-11-20 02:05:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 02:05:15,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:15,821 INFO L410 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] [2019-11-20 02:05:15,821 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1823335168, now seen corresponding path program 1 times [2019-11-20 02:05:15,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:15,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823109855] [2019-11-20 02:05:15,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:15,893 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-20 02:05:15,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823109855] [2019-11-20 02:05:15,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:15,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:15,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379441992] [2019-11-20 02:05:15,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:15,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:15,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:15,895 INFO L87 Difference]: Start difference. First operand 237 states and 371 transitions. Second operand 4 states. [2019-11-20 02:05:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:16,458 INFO L93 Difference]: Finished difference Result 516 states and 805 transitions. [2019-11-20 02:05:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:16,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-20 02:05:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:16,462 INFO L225 Difference]: With dead ends: 516 [2019-11-20 02:05:16,462 INFO L226 Difference]: Without dead ends: 298 [2019-11-20 02:05:16,463 INFO L630 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-20 02:05:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-20 02:05:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 237. [2019-11-20 02:05:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 02:05:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 370 transitions. [2019-11-20 02:05:16,471 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 370 transitions. Word has length 94 [2019-11-20 02:05:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:16,471 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 370 transitions. [2019-11-20 02:05:16,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 370 transitions. [2019-11-20 02:05:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 02:05:16,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:16,473 INFO L410 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] [2019-11-20 02:05:16,474 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2027731454, now seen corresponding path program 1 times [2019-11-20 02:05:16,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:16,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317934386] [2019-11-20 02:05:16,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:16,553 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-20 02:05:16,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317934386] [2019-11-20 02:05:16,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:16,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:16,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200321815] [2019-11-20 02:05:16,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:16,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:16,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:16,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:16,555 INFO L87 Difference]: Start difference. First operand 237 states and 370 transitions. Second operand 4 states. [2019-11-20 02:05:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:17,017 INFO L93 Difference]: Finished difference Result 481 states and 752 transitions. [2019-11-20 02:05:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:17,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-20 02:05:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:17,019 INFO L225 Difference]: With dead ends: 481 [2019-11-20 02:05:17,019 INFO L226 Difference]: Without dead ends: 263 [2019-11-20 02:05:17,020 INFO L630 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-20 02:05:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-20 02:05:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 237. [2019-11-20 02:05:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 02:05:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 369 transitions. [2019-11-20 02:05:17,028 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 369 transitions. Word has length 94 [2019-11-20 02:05:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:17,028 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 369 transitions. [2019-11-20 02:05:17,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 369 transitions. [2019-11-20 02:05:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 02:05:17,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:17,030 INFO L410 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] [2019-11-20 02:05:17,030 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:17,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1773701170, now seen corresponding path program 1 times [2019-11-20 02:05:17,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:17,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41551923] [2019-11-20 02:05:17,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:17,095 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-20 02:05:17,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41551923] [2019-11-20 02:05:17,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:17,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:17,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724066187] [2019-11-20 02:05:17,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:17,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:17,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:17,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:17,097 INFO L87 Difference]: Start difference. First operand 237 states and 369 transitions. Second operand 4 states. [2019-11-20 02:05:17,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:17,646 INFO L93 Difference]: Finished difference Result 515 states and 800 transitions. [2019-11-20 02:05:17,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:17,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 02:05:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:17,648 INFO L225 Difference]: With dead ends: 515 [2019-11-20 02:05:17,649 INFO L226 Difference]: Without dead ends: 297 [2019-11-20 02:05:17,649 INFO L630 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-20 02:05:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-20 02:05:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 237. [2019-11-20 02:05:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 02:05:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2019-11-20 02:05:17,658 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 95 [2019-11-20 02:05:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:17,659 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2019-11-20 02:05:17,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2019-11-20 02:05:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 02:05:17,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:17,661 INFO L410 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] [2019-11-20 02:05:17,661 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 911177383, now seen corresponding path program 1 times [2019-11-20 02:05:17,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:17,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351709499] [2019-11-20 02:05:17,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:17,741 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-20 02:05:17,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351709499] [2019-11-20 02:05:17,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:17,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:17,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740698833] [2019-11-20 02:05:17,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:17,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:17,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:17,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:17,744 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand 4 states. [2019-11-20 02:05:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:18,329 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2019-11-20 02:05:18,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:18,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 02:05:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:18,332 INFO L225 Difference]: With dead ends: 513 [2019-11-20 02:05:18,332 INFO L226 Difference]: Without dead ends: 295 [2019-11-20 02:05:18,332 INFO L630 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-20 02:05:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-20 02:05:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2019-11-20 02:05:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 02:05:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 367 transitions. [2019-11-20 02:05:18,339 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 367 transitions. Word has length 95 [2019-11-20 02:05:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:18,339 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 367 transitions. [2019-11-20 02:05:18,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 367 transitions. [2019-11-20 02:05:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 02:05:18,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:18,341 INFO L410 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] [2019-11-20 02:05:18,342 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash -409675929, now seen corresponding path program 1 times [2019-11-20 02:05:18,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:18,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945192471] [2019-11-20 02:05:18,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:18,424 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-20 02:05:18,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945192471] [2019-11-20 02:05:18,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:18,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:18,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771371560] [2019-11-20 02:05:18,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:18,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:18,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:18,427 INFO L87 Difference]: Start difference. First operand 237 states and 367 transitions. Second operand 4 states. [2019-11-20 02:05:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:18,979 INFO L93 Difference]: Finished difference Result 512 states and 793 transitions. [2019-11-20 02:05:18,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:18,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 02:05:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:18,981 INFO L225 Difference]: With dead ends: 512 [2019-11-20 02:05:18,982 INFO L226 Difference]: Without dead ends: 294 [2019-11-20 02:05:18,982 INFO L630 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-20 02:05:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-20 02:05:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 237. [2019-11-20 02:05:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 02:05:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 366 transitions. [2019-11-20 02:05:18,990 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 366 transitions. Word has length 95 [2019-11-20 02:05:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:18,991 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 366 transitions. [2019-11-20 02:05:18,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 366 transitions. [2019-11-20 02:05:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 02:05:18,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:18,992 INFO L410 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] [2019-11-20 02:05:18,993 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash 726190366, now seen corresponding path program 1 times [2019-11-20 02:05:18,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:18,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971240230] [2019-11-20 02:05:18,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:19,072 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-20 02:05:19,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971240230] [2019-11-20 02:05:19,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:19,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:05:19,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411992734] [2019-11-20 02:05:19,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:05:19,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:19,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:05:19,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:19,076 INFO L87 Difference]: Start difference. First operand 237 states and 366 transitions. Second operand 5 states. [2019-11-20 02:05:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:19,739 INFO L93 Difference]: Finished difference Result 476 states and 740 transitions. [2019-11-20 02:05:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:05:19,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-20 02:05:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:19,741 INFO L225 Difference]: With dead ends: 476 [2019-11-20 02:05:19,742 INFO L226 Difference]: Without dead ends: 258 [2019-11-20 02:05:19,742 INFO L630 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-20 02:05:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-20 02:05:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-11-20 02:05:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2019-11-20 02:05:19,752 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 95 [2019-11-20 02:05:19,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:19,753 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2019-11-20 02:05:19,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:05:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2019-11-20 02:05:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 02:05:19,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:19,755 INFO L410 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] [2019-11-20 02:05:19,755 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:19,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1787196389, now seen corresponding path program 1 times [2019-11-20 02:05:19,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:19,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116993433] [2019-11-20 02:05:19,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:19,825 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-20 02:05:19,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116993433] [2019-11-20 02:05:19,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:19,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:19,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288070260] [2019-11-20 02:05:19,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:19,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:19,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:19,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:19,827 INFO L87 Difference]: Start difference. First operand 257 states and 392 transitions. Second operand 4 states. [2019-11-20 02:05:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:20,240 INFO L93 Difference]: Finished difference Result 518 states and 792 transitions. [2019-11-20 02:05:20,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:20,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 02:05:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:20,243 INFO L225 Difference]: With dead ends: 518 [2019-11-20 02:05:20,243 INFO L226 Difference]: Without dead ends: 280 [2019-11-20 02:05:20,244 INFO L630 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-20 02:05:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-20 02:05:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 257. [2019-11-20 02:05:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2019-11-20 02:05:20,252 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 95 [2019-11-20 02:05:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:20,252 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2019-11-20 02:05:20,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2019-11-20 02:05:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 02:05:20,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:20,254 INFO L410 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] [2019-11-20 02:05:20,254 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:20,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash 466343077, now seen corresponding path program 1 times [2019-11-20 02:05:20,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:20,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110336353] [2019-11-20 02:05:20,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:20,315 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-20 02:05:20,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110336353] [2019-11-20 02:05:20,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:20,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:20,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803706887] [2019-11-20 02:05:20,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:20,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:20,317 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand 4 states. [2019-11-20 02:05:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:20,771 INFO L93 Difference]: Finished difference Result 517 states and 789 transitions. [2019-11-20 02:05:20,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:20,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 02:05:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:20,774 INFO L225 Difference]: With dead ends: 517 [2019-11-20 02:05:20,775 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 02:05:20,775 INFO L630 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-20 02:05:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 02:05:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-20 02:05:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2019-11-20 02:05:20,786 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 95 [2019-11-20 02:05:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:20,787 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2019-11-20 02:05:20,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2019-11-20 02:05:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 02:05:20,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:20,789 INFO L410 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] [2019-11-20 02:05:20,789 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1195259004, now seen corresponding path program 1 times [2019-11-20 02:05:20,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:20,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345704331] [2019-11-20 02:05:20,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:20,853 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-20 02:05:20,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345704331] [2019-11-20 02:05:20,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:20,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:20,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023072548] [2019-11-20 02:05:20,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:20,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:20,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:20,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:20,855 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2019-11-20 02:05:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:21,454 INFO L93 Difference]: Finished difference Result 552 states and 838 transitions. [2019-11-20 02:05:21,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:21,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 02:05:21,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:21,457 INFO L225 Difference]: With dead ends: 552 [2019-11-20 02:05:21,457 INFO L226 Difference]: Without dead ends: 314 [2019-11-20 02:05:21,458 INFO L630 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-20 02:05:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-20 02:05:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2019-11-20 02:05:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2019-11-20 02:05:21,471 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 96 [2019-11-20 02:05:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:21,472 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2019-11-20 02:05:21,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2019-11-20 02:05:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 02:05:21,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:21,474 INFO L410 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] [2019-11-20 02:05:21,474 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash 191526406, now seen corresponding path program 1 times [2019-11-20 02:05:21,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:21,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542779989] [2019-11-20 02:05:21,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:21,549 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-20 02:05:21,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542779989] [2019-11-20 02:05:21,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:21,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:21,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053443586] [2019-11-20 02:05:21,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:21,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:21,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:21,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:21,551 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2019-11-20 02:05:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:22,074 INFO L93 Difference]: Finished difference Result 517 states and 785 transitions. [2019-11-20 02:05:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:22,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 02:05:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:22,077 INFO L225 Difference]: With dead ends: 517 [2019-11-20 02:05:22,077 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 02:05:22,078 INFO L630 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-20 02:05:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 02:05:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-20 02:05:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2019-11-20 02:05:22,087 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 96 [2019-11-20 02:05:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:22,088 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2019-11-20 02:05:22,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2019-11-20 02:05:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 02:05:22,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:22,090 INFO L410 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] [2019-11-20 02:05:22,090 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:22,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:22,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1293006805, now seen corresponding path program 1 times [2019-11-20 02:05:22,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:22,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047138442] [2019-11-20 02:05:22,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:22,160 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-20 02:05:22,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047138442] [2019-11-20 02:05:22,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:22,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:22,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526553386] [2019-11-20 02:05:22,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:22,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:22,163 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2019-11-20 02:05:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:22,632 INFO L93 Difference]: Finished difference Result 552 states and 834 transitions. [2019-11-20 02:05:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:22,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 02:05:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:22,634 INFO L225 Difference]: With dead ends: 552 [2019-11-20 02:05:22,635 INFO L226 Difference]: Without dead ends: 314 [2019-11-20 02:05:22,635 INFO L630 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-20 02:05:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-20 02:05:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2019-11-20 02:05:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2019-11-20 02:05:22,643 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 97 [2019-11-20 02:05:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:22,643 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2019-11-20 02:05:22,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2019-11-20 02:05:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 02:05:22,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:22,644 INFO L410 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] [2019-11-20 02:05:22,644 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:22,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1252332055, now seen corresponding path program 1 times [2019-11-20 02:05:22,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:22,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007659335] [2019-11-20 02:05:22,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:22,700 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-20 02:05:22,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007659335] [2019-11-20 02:05:22,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:22,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:22,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123846867] [2019-11-20 02:05:22,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:22,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:22,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:22,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:22,702 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2019-11-20 02:05:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:23,054 INFO L93 Difference]: Finished difference Result 517 states and 781 transitions. [2019-11-20 02:05:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:23,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 02:05:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:23,056 INFO L225 Difference]: With dead ends: 517 [2019-11-20 02:05:23,056 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 02:05:23,057 INFO L630 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-20 02:05:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 02:05:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-20 02:05:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2019-11-20 02:05:23,068 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 97 [2019-11-20 02:05:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:23,068 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2019-11-20 02:05:23,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2019-11-20 02:05:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 02:05:23,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:23,070 INFO L410 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] [2019-11-20 02:05:23,070 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:23,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1236541353, now seen corresponding path program 1 times [2019-11-20 02:05:23,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:23,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363808087] [2019-11-20 02:05:23,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:23,133 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-20 02:05:23,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363808087] [2019-11-20 02:05:23,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:23,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:23,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650212072] [2019-11-20 02:05:23,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:23,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:23,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:23,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:23,135 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2019-11-20 02:05:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:23,587 INFO L93 Difference]: Finished difference Result 552 states and 830 transitions. [2019-11-20 02:05:23,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:23,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 02:05:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:23,589 INFO L225 Difference]: With dead ends: 552 [2019-11-20 02:05:23,589 INFO L226 Difference]: Without dead ends: 314 [2019-11-20 02:05:23,590 INFO L630 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-20 02:05:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-20 02:05:23,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2019-11-20 02:05:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2019-11-20 02:05:23,598 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 98 [2019-11-20 02:05:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:23,599 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2019-11-20 02:05:23,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2019-11-20 02:05:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 02:05:23,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:23,600 INFO L410 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] [2019-11-20 02:05:23,600 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:23,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:23,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1797508693, now seen corresponding path program 1 times [2019-11-20 02:05:23,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:23,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193130865] [2019-11-20 02:05:23,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:23,659 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-20 02:05:23,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193130865] [2019-11-20 02:05:23,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:23,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:23,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622659495] [2019-11-20 02:05:23,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:23,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:23,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:23,661 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2019-11-20 02:05:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:24,054 INFO L93 Difference]: Finished difference Result 517 states and 777 transitions. [2019-11-20 02:05:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:24,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 02:05:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:24,056 INFO L225 Difference]: With dead ends: 517 [2019-11-20 02:05:24,056 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 02:05:24,057 INFO L630 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-20 02:05:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 02:05:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-20 02:05:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2019-11-20 02:05:24,065 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 98 [2019-11-20 02:05:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:24,065 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2019-11-20 02:05:24,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2019-11-20 02:05:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 02:05:24,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:24,067 INFO L410 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] [2019-11-20 02:05:24,067 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash -687081680, now seen corresponding path program 1 times [2019-11-20 02:05:24,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:24,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386904807] [2019-11-20 02:05:24,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:24,130 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-20 02:05:24,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386904807] [2019-11-20 02:05:24,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:24,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:24,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036275615] [2019-11-20 02:05:24,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:24,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:24,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:24,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:24,133 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2019-11-20 02:05:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:24,473 INFO L93 Difference]: Finished difference Result 542 states and 814 transitions. [2019-11-20 02:05:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:24,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 02:05:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:24,475 INFO L225 Difference]: With dead ends: 542 [2019-11-20 02:05:24,475 INFO L226 Difference]: Without dead ends: 304 [2019-11-20 02:05:24,476 INFO L630 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-20 02:05:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-20 02:05:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 257. [2019-11-20 02:05:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2019-11-20 02:05:24,484 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 99 [2019-11-20 02:05:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:24,485 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2019-11-20 02:05:24,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2019-11-20 02:05:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 02:05:24,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:24,486 INFO L410 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] [2019-11-20 02:05:24,486 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:24,487 INFO L82 PathProgramCache]: Analyzing trace with hash -253352594, now seen corresponding path program 1 times [2019-11-20 02:05:24,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:24,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836329496] [2019-11-20 02:05:24,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:24,558 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-20 02:05:24,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836329496] [2019-11-20 02:05:24,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:24,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:24,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646972954] [2019-11-20 02:05:24,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:24,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:24,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:24,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:24,560 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2019-11-20 02:05:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:24,986 INFO L93 Difference]: Finished difference Result 507 states and 761 transitions. [2019-11-20 02:05:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:24,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 02:05:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:24,989 INFO L225 Difference]: With dead ends: 507 [2019-11-20 02:05:24,989 INFO L226 Difference]: Without dead ends: 269 [2019-11-20 02:05:24,990 INFO L630 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-20 02:05:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-20 02:05:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 257. [2019-11-20 02:05:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-11-20 02:05:25,002 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 99 [2019-11-20 02:05:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:25,002 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-11-20 02:05:25,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-11-20 02:05:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 02:05:25,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:25,004 INFO L410 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] [2019-11-20 02:05:25,005 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:25,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash -401565846, now seen corresponding path program 1 times [2019-11-20 02:05:25,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:25,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670485480] [2019-11-20 02:05:25,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:25,081 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-20 02:05:25,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670485480] [2019-11-20 02:05:25,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:25,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:25,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448213566] [2019-11-20 02:05:25,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:25,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:25,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:25,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:25,083 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2019-11-20 02:05:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:25,628 INFO L93 Difference]: Finished difference Result 542 states and 810 transitions. [2019-11-20 02:05:25,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:25,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 02:05:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:25,630 INFO L225 Difference]: With dead ends: 542 [2019-11-20 02:05:25,630 INFO L226 Difference]: Without dead ends: 304 [2019-11-20 02:05:25,631 INFO L630 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-20 02:05:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-20 02:05:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 257. [2019-11-20 02:05:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 02:05:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2019-11-20 02:05:25,639 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 103 [2019-11-20 02:05:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:25,640 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2019-11-20 02:05:25,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2019-11-20 02:05:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 02:05:25,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:25,642 INFO L410 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] [2019-11-20 02:05:25,642 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 277706408, now seen corresponding path program 1 times [2019-11-20 02:05:25,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:25,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285926972] [2019-11-20 02:05:25,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:25,707 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-20 02:05:25,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285926972] [2019-11-20 02:05:25,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:25,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:05:25,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433851179] [2019-11-20 02:05:25,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:05:25,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:05:25,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:25,710 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 3 states. [2019-11-20 02:05:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:25,783 INFO L93 Difference]: Finished difference Result 731 states and 1098 transitions. [2019-11-20 02:05:25,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:05:25,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-20 02:05:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:25,787 INFO L225 Difference]: With dead ends: 731 [2019-11-20 02:05:25,787 INFO L226 Difference]: Without dead ends: 493 [2019-11-20 02:05:25,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-11-20 02:05:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-11-20 02:05:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-20 02:05:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 729 transitions. [2019-11-20 02:05:25,803 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 729 transitions. Word has length 103 [2019-11-20 02:05:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:25,804 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 729 transitions. [2019-11-20 02:05:25,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:05:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 729 transitions. [2019-11-20 02:05:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 02:05:25,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:25,806 INFO L410 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] [2019-11-20 02:05:25,806 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash -980347234, now seen corresponding path program 1 times [2019-11-20 02:05:25,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:25,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041239451] [2019-11-20 02:05:25,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:05:25,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041239451] [2019-11-20 02:05:25,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:25,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:05:25,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39147507] [2019-11-20 02:05:25,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:05:25,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:05:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:25,883 INFO L87 Difference]: Start difference. First operand 493 states and 729 transitions. Second operand 3 states. [2019-11-20 02:05:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:25,973 INFO L93 Difference]: Finished difference Result 1203 states and 1794 transitions. [2019-11-20 02:05:25,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:05:25,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 02:05:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:25,977 INFO L225 Difference]: With dead ends: 1203 [2019-11-20 02:05:25,978 INFO L226 Difference]: Without dead ends: 729 [2019-11-20 02:05:25,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-11-20 02:05:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2019-11-20 02:05:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-11-20 02:05:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1078 transitions. [2019-11-20 02:05:26,001 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1078 transitions. Word has length 105 [2019-11-20 02:05:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:26,002 INFO L462 AbstractCegarLoop]: Abstraction has 729 states and 1078 transitions. [2019-11-20 02:05:26,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:05:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1078 transitions. [2019-11-20 02:05:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 02:05:26,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:26,005 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:26,005 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash 712583787, now seen corresponding path program 1 times [2019-11-20 02:05:26,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:26,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398562112] [2019-11-20 02:05:26,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:26,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398562112] [2019-11-20 02:05:26,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:26,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:26,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470332939] [2019-11-20 02:05:26,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:26,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:26,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:26,082 INFO L87 Difference]: Start difference. First operand 729 states and 1078 transitions. Second operand 4 states. [2019-11-20 02:05:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:26,596 INFO L93 Difference]: Finished difference Result 1628 states and 2428 transitions. [2019-11-20 02:05:26,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:26,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-20 02:05:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:26,602 INFO L225 Difference]: With dead ends: 1628 [2019-11-20 02:05:26,602 INFO L226 Difference]: Without dead ends: 918 [2019-11-20 02:05:26,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-20 02:05:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 813. [2019-11-20 02:05:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1225 transitions. [2019-11-20 02:05:26,639 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1225 transitions. Word has length 134 [2019-11-20 02:05:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:26,640 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1225 transitions. [2019-11-20 02:05:26,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1225 transitions. [2019-11-20 02:05:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 02:05:26,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:26,643 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:26,643 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:26,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1422709559, now seen corresponding path program 1 times [2019-11-20 02:05:26,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:26,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209307226] [2019-11-20 02:05:26,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:26,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209307226] [2019-11-20 02:05:26,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:26,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:26,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517367816] [2019-11-20 02:05:26,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:26,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:26,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:26,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:26,735 INFO L87 Difference]: Start difference. First operand 813 states and 1225 transitions. Second operand 4 states. [2019-11-20 02:05:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:27,259 INFO L93 Difference]: Finished difference Result 1712 states and 2572 transitions. [2019-11-20 02:05:27,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:27,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-20 02:05:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:27,266 INFO L225 Difference]: With dead ends: 1712 [2019-11-20 02:05:27,266 INFO L226 Difference]: Without dead ends: 918 [2019-11-20 02:05:27,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-20 02:05:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 813. [2019-11-20 02:05:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1222 transitions. [2019-11-20 02:05:27,302 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1222 transitions. Word has length 147 [2019-11-20 02:05:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:27,303 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1222 transitions. [2019-11-20 02:05:27,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1222 transitions. [2019-11-20 02:05:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 02:05:27,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:27,308 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:27,308 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:27,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:27,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1376685392, now seen corresponding path program 1 times [2019-11-20 02:05:27,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:27,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671912261] [2019-11-20 02:05:27,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:27,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671912261] [2019-11-20 02:05:27,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:27,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:27,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387200481] [2019-11-20 02:05:27,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:27,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:27,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:27,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:27,395 INFO L87 Difference]: Start difference. First operand 813 states and 1222 transitions. Second operand 4 states. [2019-11-20 02:05:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:27,832 INFO L93 Difference]: Finished difference Result 1706 states and 2560 transitions. [2019-11-20 02:05:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:27,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-20 02:05:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:27,839 INFO L225 Difference]: With dead ends: 1706 [2019-11-20 02:05:27,839 INFO L226 Difference]: Without dead ends: 912 [2019-11-20 02:05:27,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-11-20 02:05:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 813. [2019-11-20 02:05:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1219 transitions. [2019-11-20 02:05:27,866 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1219 transitions. Word has length 148 [2019-11-20 02:05:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:27,868 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1219 transitions. [2019-11-20 02:05:27,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1219 transitions. [2019-11-20 02:05:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 02:05:27,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:27,871 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:27,871 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash 55832080, now seen corresponding path program 1 times [2019-11-20 02:05:27,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:27,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302894463] [2019-11-20 02:05:27,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:27,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302894463] [2019-11-20 02:05:27,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:27,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:27,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044742922] [2019-11-20 02:05:27,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:27,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:27,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:27,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:27,966 INFO L87 Difference]: Start difference. First operand 813 states and 1219 transitions. Second operand 4 states. [2019-11-20 02:05:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:28,514 INFO L93 Difference]: Finished difference Result 1703 states and 2551 transitions. [2019-11-20 02:05:28,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:28,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-20 02:05:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:28,520 INFO L225 Difference]: With dead ends: 1703 [2019-11-20 02:05:28,520 INFO L226 Difference]: Without dead ends: 909 [2019-11-20 02:05:28,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-20 02:05:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-11-20 02:05:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1216 transitions. [2019-11-20 02:05:28,550 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1216 transitions. Word has length 148 [2019-11-20 02:05:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:28,550 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1216 transitions. [2019-11-20 02:05:28,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1216 transitions. [2019-11-20 02:05:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 02:05:28,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:28,553 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:28,554 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:28,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash 350587387, now seen corresponding path program 1 times [2019-11-20 02:05:28,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:28,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166337847] [2019-11-20 02:05:28,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:28,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166337847] [2019-11-20 02:05:28,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:28,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:28,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008180289] [2019-11-20 02:05:28,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:28,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:28,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:28,639 INFO L87 Difference]: Start difference. First operand 813 states and 1216 transitions. Second operand 4 states. [2019-11-20 02:05:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:29,157 INFO L93 Difference]: Finished difference Result 1703 states and 2545 transitions. [2019-11-20 02:05:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:29,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-20 02:05:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:29,164 INFO L225 Difference]: With dead ends: 1703 [2019-11-20 02:05:29,164 INFO L226 Difference]: Without dead ends: 909 [2019-11-20 02:05:29,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-20 02:05:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-11-20 02:05:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1213 transitions. [2019-11-20 02:05:29,247 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1213 transitions. Word has length 149 [2019-11-20 02:05:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:29,247 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1213 transitions. [2019-11-20 02:05:29,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1213 transitions. [2019-11-20 02:05:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 02:05:29,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:29,254 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:29,254 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:29,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash -616408940, now seen corresponding path program 1 times [2019-11-20 02:05:29,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:29,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123856628] [2019-11-20 02:05:29,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:29,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123856628] [2019-11-20 02:05:29,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:29,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:29,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443291402] [2019-11-20 02:05:29,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:29,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:29,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:29,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:29,378 INFO L87 Difference]: Start difference. First operand 813 states and 1213 transitions. Second operand 4 states. [2019-11-20 02:05:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:29,730 INFO L93 Difference]: Finished difference Result 1703 states and 2539 transitions. [2019-11-20 02:05:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:29,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-20 02:05:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:29,735 INFO L225 Difference]: With dead ends: 1703 [2019-11-20 02:05:29,735 INFO L226 Difference]: Without dead ends: 909 [2019-11-20 02:05:29,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-20 02:05:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-11-20 02:05:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1210 transitions. [2019-11-20 02:05:29,758 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1210 transitions. Word has length 150 [2019-11-20 02:05:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:29,758 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1210 transitions. [2019-11-20 02:05:29,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1210 transitions. [2019-11-20 02:05:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 02:05:29,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:29,761 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:29,761 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash 736238688, now seen corresponding path program 1 times [2019-11-20 02:05:29,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:29,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75892891] [2019-11-20 02:05:29,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:29,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75892891] [2019-11-20 02:05:29,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:29,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:29,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278422294] [2019-11-20 02:05:29,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:29,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:29,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:29,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:29,843 INFO L87 Difference]: Start difference. First operand 813 states and 1210 transitions. Second operand 4 states. [2019-11-20 02:05:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:30,263 INFO L93 Difference]: Finished difference Result 1703 states and 2533 transitions. [2019-11-20 02:05:30,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:30,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-20 02:05:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:30,267 INFO L225 Difference]: With dead ends: 1703 [2019-11-20 02:05:30,267 INFO L226 Difference]: Without dead ends: 909 [2019-11-20 02:05:30,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-20 02:05:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-11-20 02:05:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1207 transitions. [2019-11-20 02:05:30,291 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1207 transitions. Word has length 151 [2019-11-20 02:05:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:30,291 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1207 transitions. [2019-11-20 02:05:30,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1207 transitions. [2019-11-20 02:05:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 02:05:30,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:30,294 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:30,294 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:30,295 INFO L82 PathProgramCache]: Analyzing trace with hash 983404889, now seen corresponding path program 1 times [2019-11-20 02:05:30,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:30,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912798696] [2019-11-20 02:05:30,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:30,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912798696] [2019-11-20 02:05:30,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:30,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:30,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302635143] [2019-11-20 02:05:30,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:30,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:30,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:30,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:30,378 INFO L87 Difference]: Start difference. First operand 813 states and 1207 transitions. Second operand 4 states. [2019-11-20 02:05:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:30,754 INFO L93 Difference]: Finished difference Result 1673 states and 2491 transitions. [2019-11-20 02:05:30,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:30,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-20 02:05:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:30,760 INFO L225 Difference]: With dead ends: 1673 [2019-11-20 02:05:30,760 INFO L226 Difference]: Without dead ends: 879 [2019-11-20 02:05:30,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-11-20 02:05:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 813. [2019-11-20 02:05:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1204 transitions. [2019-11-20 02:05:30,786 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1204 transitions. Word has length 152 [2019-11-20 02:05:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:30,786 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1204 transitions. [2019-11-20 02:05:30,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1204 transitions. [2019-11-20 02:05:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 02:05:30,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:30,790 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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-20 02:05:30,790 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:30,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1752763117, now seen corresponding path program 1 times [2019-11-20 02:05:30,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:30,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385337554] [2019-11-20 02:05:30,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:30,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385337554] [2019-11-20 02:05:30,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:30,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:30,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640386054] [2019-11-20 02:05:30,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:30,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:30,894 INFO L87 Difference]: Start difference. First operand 813 states and 1204 transitions. Second operand 4 states. [2019-11-20 02:05:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:31,413 INFO L93 Difference]: Finished difference Result 1673 states and 2485 transitions. [2019-11-20 02:05:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:31,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-20 02:05:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:31,420 INFO L225 Difference]: With dead ends: 1673 [2019-11-20 02:05:31,420 INFO L226 Difference]: Without dead ends: 879 [2019-11-20 02:05:31,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-11-20 02:05:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 813. [2019-11-20 02:05:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1201 transitions. [2019-11-20 02:05:31,499 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1201 transitions. Word has length 156 [2019-11-20 02:05:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:31,500 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1201 transitions. [2019-11-20 02:05:31,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1201 transitions. [2019-11-20 02:05:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 02:05:31,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:31,502 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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-20 02:05:31,503 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1490860902, now seen corresponding path program 1 times [2019-11-20 02:05:31,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:31,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790748100] [2019-11-20 02:05:31,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:05:31,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790748100] [2019-11-20 02:05:31,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:31,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:31,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349677616] [2019-11-20 02:05:31,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:31,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:31,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:31,590 INFO L87 Difference]: Start difference. First operand 813 states and 1201 transitions. Second operand 4 states. [2019-11-20 02:05:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:31,899 INFO L93 Difference]: Finished difference Result 1658 states and 2458 transitions. [2019-11-20 02:05:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:31,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-20 02:05:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:31,903 INFO L225 Difference]: With dead ends: 1658 [2019-11-20 02:05:31,903 INFO L226 Difference]: Without dead ends: 864 [2019-11-20 02:05:31,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-11-20 02:05:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 813. [2019-11-20 02:05:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 02:05:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1198 transitions. [2019-11-20 02:05:31,928 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1198 transitions. Word has length 157 [2019-11-20 02:05:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:31,929 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1198 transitions. [2019-11-20 02:05:31,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1198 transitions. [2019-11-20 02:05:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 02:05:31,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:31,932 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:31,932 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 870486010, now seen corresponding path program 1 times [2019-11-20 02:05:31,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:31,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724661694] [2019-11-20 02:05:31,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 02:05:32,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724661694] [2019-11-20 02:05:32,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:32,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:32,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033483815] [2019-11-20 02:05:32,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:32,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:32,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:32,032 INFO L87 Difference]: Start difference. First operand 813 states and 1198 transitions. Second operand 4 states. [2019-11-20 02:05:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:32,603 INFO L93 Difference]: Finished difference Result 1808 states and 2686 transitions. [2019-11-20 02:05:32,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:32,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-20 02:05:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:32,610 INFO L225 Difference]: With dead ends: 1808 [2019-11-20 02:05:32,611 INFO L226 Difference]: Without dead ends: 1014 [2019-11-20 02:05:32,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-11-20 02:05:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 903. [2019-11-20 02:05:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-11-20 02:05:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1357 transitions. [2019-11-20 02:05:32,638 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1357 transitions. Word has length 159 [2019-11-20 02:05:32,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:32,639 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1357 transitions. [2019-11-20 02:05:32,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1357 transitions. [2019-11-20 02:05:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 02:05:32,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:32,642 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:32,643 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash 402001855, now seen corresponding path program 1 times [2019-11-20 02:05:32,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:32,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444706679] [2019-11-20 02:05:32,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 02:05:32,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444706679] [2019-11-20 02:05:32,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:32,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:05:32,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571180843] [2019-11-20 02:05:32,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:05:32,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:32,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:05:32,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:32,734 INFO L87 Difference]: Start difference. First operand 903 states and 1357 transitions. Second operand 3 states. [2019-11-20 02:05:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:32,835 INFO L93 Difference]: Finished difference Result 2081 states and 3143 transitions. [2019-11-20 02:05:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:05:32,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-20 02:05:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:32,842 INFO L225 Difference]: With dead ends: 2081 [2019-11-20 02:05:32,843 INFO L226 Difference]: Without dead ends: 1197 [2019-11-20 02:05:32,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-20 02:05:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-20 02:05:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-20 02:05:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1801 transitions. [2019-11-20 02:05:32,875 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1801 transitions. Word has length 165 [2019-11-20 02:05:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:32,877 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1801 transitions. [2019-11-20 02:05:32,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:05:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1801 transitions. [2019-11-20 02:05:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 02:05:32,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:32,881 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:32,881 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:32,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1332197165, now seen corresponding path program 1 times [2019-11-20 02:05:32,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:32,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439011012] [2019-11-20 02:05:32,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 02:05:32,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439011012] [2019-11-20 02:05:32,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:32,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:32,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031288821] [2019-11-20 02:05:32,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:32,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:32,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:32,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:32,981 INFO L87 Difference]: Start difference. First operand 1197 states and 1801 transitions. Second operand 4 states. [2019-11-20 02:05:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:33,419 INFO L93 Difference]: Finished difference Result 2443 states and 3684 transitions. [2019-11-20 02:05:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:33,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-20 02:05:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:33,427 INFO L225 Difference]: With dead ends: 2443 [2019-11-20 02:05:33,427 INFO L226 Difference]: Without dead ends: 1265 [2019-11-20 02:05:33,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-11-20 02:05:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1197. [2019-11-20 02:05:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-20 02:05:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1797 transitions. [2019-11-20 02:05:33,462 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1797 transitions. Word has length 188 [2019-11-20 02:05:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:33,463 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1797 transitions. [2019-11-20 02:05:33,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1797 transitions. [2019-11-20 02:05:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 02:05:33,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:33,467 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1] [2019-11-20 02:05:33,467 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:33,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1479571284, now seen corresponding path program 1 times [2019-11-20 02:05:33,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:33,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825194942] [2019-11-20 02:05:33,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 02:05:33,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825194942] [2019-11-20 02:05:33,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:33,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:33,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204223305] [2019-11-20 02:05:33,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:33,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:33,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:33,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:33,565 INFO L87 Difference]: Start difference. First operand 1197 states and 1797 transitions. Second operand 4 states. [2019-11-20 02:05:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:34,023 INFO L93 Difference]: Finished difference Result 2427 states and 3652 transitions. [2019-11-20 02:05:34,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:34,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-20 02:05:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:34,029 INFO L225 Difference]: With dead ends: 2427 [2019-11-20 02:05:34,030 INFO L226 Difference]: Without dead ends: 1249 [2019-11-20 02:05:34,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-11-20 02:05:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1197. [2019-11-20 02:05:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-20 02:05:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1793 transitions. [2019-11-20 02:05:34,060 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1793 transitions. Word has length 189 [2019-11-20 02:05:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:34,060 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1793 transitions. [2019-11-20 02:05:34,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1793 transitions. [2019-11-20 02:05:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 02:05:34,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:34,063 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:34,064 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1805622995, now seen corresponding path program 1 times [2019-11-20 02:05:34,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:34,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928829748] [2019-11-20 02:05:34,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-20 02:05:34,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928829748] [2019-11-20 02:05:34,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:34,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:05:34,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251615243] [2019-11-20 02:05:34,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:05:34,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:05:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:34,194 INFO L87 Difference]: Start difference. First operand 1197 states and 1793 transitions. Second operand 3 states. [2019-11-20 02:05:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:34,286 INFO L93 Difference]: Finished difference Result 2669 states and 4013 transitions. [2019-11-20 02:05:34,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:05:34,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-20 02:05:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:34,295 INFO L225 Difference]: With dead ends: 2669 [2019-11-20 02:05:34,295 INFO L226 Difference]: Without dead ends: 1491 [2019-11-20 02:05:34,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-11-20 02:05:34,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2019-11-20 02:05:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-11-20 02:05:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2236 transitions. [2019-11-20 02:05:34,326 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2236 transitions. Word has length 197 [2019-11-20 02:05:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:34,326 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 2236 transitions. [2019-11-20 02:05:34,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:05:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2236 transitions. [2019-11-20 02:05:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 02:05:34,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:34,330 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:34,330 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1322460169, now seen corresponding path program 1 times [2019-11-20 02:05:34,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:34,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184018423] [2019-11-20 02:05:34,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-20 02:05:34,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184018423] [2019-11-20 02:05:34,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:34,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:05:34,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961946646] [2019-11-20 02:05:34,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:05:34,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:34,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:05:34,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:34,428 INFO L87 Difference]: Start difference. First operand 1491 states and 2236 transitions. Second operand 3 states. [2019-11-20 02:05:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:34,524 INFO L93 Difference]: Finished difference Result 3257 states and 4899 transitions. [2019-11-20 02:05:34,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:05:34,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-20 02:05:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:34,535 INFO L225 Difference]: With dead ends: 3257 [2019-11-20 02:05:34,540 INFO L226 Difference]: Without dead ends: 1785 [2019-11-20 02:05:34,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-11-20 02:05:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2019-11-20 02:05:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-11-20 02:05:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2680 transitions. [2019-11-20 02:05:34,595 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2680 transitions. Word has length 199 [2019-11-20 02:05:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:34,595 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 2680 transitions. [2019-11-20 02:05:34,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:05:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2680 transitions. [2019-11-20 02:05:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 02:05:34,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:34,600 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:34,600 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:34,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1509594081, now seen corresponding path program 1 times [2019-11-20 02:05:34,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:34,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660050315] [2019-11-20 02:05:34,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-20 02:05:34,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660050315] [2019-11-20 02:05:34,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:34,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:05:34,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668789364] [2019-11-20 02:05:34,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:05:34,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:05:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:34,725 INFO L87 Difference]: Start difference. First operand 1785 states and 2680 transitions. Second operand 3 states. [2019-11-20 02:05:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:34,835 INFO L93 Difference]: Finished difference Result 3845 states and 5787 transitions. [2019-11-20 02:05:34,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:05:34,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-20 02:05:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:34,847 INFO L225 Difference]: With dead ends: 3845 [2019-11-20 02:05:34,847 INFO L226 Difference]: Without dead ends: 2079 [2019-11-20 02:05:34,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-11-20 02:05:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2079. [2019-11-20 02:05:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2019-11-20 02:05:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3125 transitions. [2019-11-20 02:05:34,909 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3125 transitions. Word has length 232 [2019-11-20 02:05:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:34,909 INFO L462 AbstractCegarLoop]: Abstraction has 2079 states and 3125 transitions. [2019-11-20 02:05:34,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:05:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3125 transitions. [2019-11-20 02:05:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-20 02:05:34,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:34,914 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:34,915 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2072566463, now seen corresponding path program 1 times [2019-11-20 02:05:34,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:34,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633685584] [2019-11-20 02:05:34,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-11-20 02:05:35,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633685584] [2019-11-20 02:05:35,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:35,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:05:35,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253661529] [2019-11-20 02:05:35,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:05:35,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:05:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:35,060 INFO L87 Difference]: Start difference. First operand 2079 states and 3125 transitions. Second operand 3 states. [2019-11-20 02:05:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:35,205 INFO L93 Difference]: Finished difference Result 4428 states and 6670 transitions. [2019-11-20 02:05:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:05:35,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-11-20 02:05:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:35,211 INFO L225 Difference]: With dead ends: 4428 [2019-11-20 02:05:35,211 INFO L226 Difference]: Without dead ends: 2368 [2019-11-20 02:05:35,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2019-11-20 02:05:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2019-11-20 02:05:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2368 states. [2019-11-20 02:05:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3555 transitions. [2019-11-20 02:05:35,277 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3555 transitions. Word has length 267 [2019-11-20 02:05:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:35,277 INFO L462 AbstractCegarLoop]: Abstraction has 2368 states and 3555 transitions. [2019-11-20 02:05:35,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:05:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3555 transitions. [2019-11-20 02:05:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-20 02:05:35,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:35,283 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:35,283 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:35,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1787849424, now seen corresponding path program 1 times [2019-11-20 02:05:35,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:35,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081904946] [2019-11-20 02:05:35,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-11-20 02:05:35,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081904946] [2019-11-20 02:05:35,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:35,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:05:35,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699729891] [2019-11-20 02:05:35,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:05:35,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:05:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:35,583 INFO L87 Difference]: Start difference. First operand 2368 states and 3555 transitions. Second operand 3 states. [2019-11-20 02:05:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:35,699 INFO L93 Difference]: Finished difference Result 5011 states and 7537 transitions. [2019-11-20 02:05:35,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:05:35,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-11-20 02:05:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:35,705 INFO L225 Difference]: With dead ends: 5011 [2019-11-20 02:05:35,706 INFO L226 Difference]: Without dead ends: 2662 [2019-11-20 02:05:35,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-11-20 02:05:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. [2019-11-20 02:05:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2019-11-20 02:05:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 4002 transitions. [2019-11-20 02:05:35,772 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 4002 transitions. Word has length 306 [2019-11-20 02:05:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:35,773 INFO L462 AbstractCegarLoop]: Abstraction has 2662 states and 4002 transitions. [2019-11-20 02:05:35,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:05:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 4002 transitions. [2019-11-20 02:05:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-11-20 02:05:35,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:35,779 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 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-20 02:05:35,779 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:35,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1856469910, now seen corresponding path program 1 times [2019-11-20 02:05:35,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:35,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305859648] [2019-11-20 02:05:35,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-11-20 02:05:35,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305859648] [2019-11-20 02:05:35,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:35,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:05:35,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789237033] [2019-11-20 02:05:35,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:05:35,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:35,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:05:35,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:35,958 INFO L87 Difference]: Start difference. First operand 2662 states and 4002 transitions. Second operand 3 states. [2019-11-20 02:05:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:36,057 INFO L93 Difference]: Finished difference Result 2958 states and 4452 transitions. [2019-11-20 02:05:36,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:05:36,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-11-20 02:05:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:36,063 INFO L225 Difference]: With dead ends: 2958 [2019-11-20 02:05:36,063 INFO L226 Difference]: Without dead ends: 2956 [2019-11-20 02:05:36,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:05:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2019-11-20 02:05:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2956. [2019-11-20 02:05:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-11-20 02:05:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4450 transitions. [2019-11-20 02:05:36,137 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4450 transitions. Word has length 347 [2019-11-20 02:05:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:36,138 INFO L462 AbstractCegarLoop]: Abstraction has 2956 states and 4450 transitions. [2019-11-20 02:05:36,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:05:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4450 transitions. [2019-11-20 02:05:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-20 02:05:36,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:36,144 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 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-20 02:05:36,145 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:36,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash 51951590, now seen corresponding path program 1 times [2019-11-20 02:05:36,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:36,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558827273] [2019-11-20 02:05:36,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-11-20 02:05:36,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558827273] [2019-11-20 02:05:36,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:36,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:36,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439499059] [2019-11-20 02:05:36,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:36,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:36,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:36,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:36,450 INFO L87 Difference]: Start difference. First operand 2956 states and 4450 transitions. Second operand 4 states. [2019-11-20 02:05:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:36,972 INFO L93 Difference]: Finished difference Result 6942 states and 10480 transitions. [2019-11-20 02:05:36,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:36,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-11-20 02:05:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:36,980 INFO L225 Difference]: With dead ends: 6942 [2019-11-20 02:05:36,981 INFO L226 Difference]: Without dead ends: 4005 [2019-11-20 02:05:36,984 INFO L630 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-20 02:05:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2019-11-20 02:05:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3366. [2019-11-20 02:05:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2019-11-20 02:05:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 5200 transitions. [2019-11-20 02:05:37,074 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 5200 transitions. Word has length 390 [2019-11-20 02:05:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:37,075 INFO L462 AbstractCegarLoop]: Abstraction has 3366 states and 5200 transitions. [2019-11-20 02:05:37,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 5200 transitions. [2019-11-20 02:05:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-20 02:05:37,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:37,083 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 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-20 02:05:37,083 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash 998989476, now seen corresponding path program 1 times [2019-11-20 02:05:37,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:37,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925155362] [2019-11-20 02:05:37,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 708 proven. 91 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-11-20 02:05:37,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925155362] [2019-11-20 02:05:37,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204287674] [2019-11-20 02:05:37,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:05:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:38,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 02:05:38,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:05:38,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 02:05:38,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,382 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_164|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-20 02:05:38,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 02:05:38,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:05:38,502 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,555 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:05:38,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:05:38,556 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,569 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-20 02:05:38,645 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:05:38,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:05:38,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 02:05:38,713 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:05:38,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:05:38,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 02:05:38,726 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-11-20 02:05:38,730 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:38,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,822 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 02:05:38,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 02:05:38,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 02:05:38,888 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:05:38,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:05:38,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 02:05:38,950 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:05:38,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:05:38,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:38,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:38,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 02:05:38,977 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-11-20 02:05:38,980 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:39,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,075 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 02:05:39,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 02:05:39,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:39,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:39,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 02:05:39,104 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-11-20 02:05:39,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 02:05:39,109 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:39,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,268 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 02:05:39,268 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-20 02:05:39,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-20 02:05:39,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:05:39,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:05:39,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:05:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:05:39,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-20 02:05:39,422 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-11-20 02:05:39,423 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 4.6 percent of original size [2019-11-20 02:05:39,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:39,423 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-20 02:05:39,427 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-20 02:05:39,429 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:39,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,513 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 02:05:39,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 02:05:39,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:39,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:39,525 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 02:05:39,542 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-11-20 02:05:39,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 02:05:39,547 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:39,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,678 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 02:05:39,678 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-20 02:05:39,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-20 02:05:39,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:39,683 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:39,714 INFO L567 ElimStorePlain]: treesize reduction 156, result has 25.7 percent of original size [2019-11-20 02:05:39,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:39,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-20 02:05:39,723 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_163|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-11-20 02:05:39,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2019-11-20 02:05:39,732 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:39,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 34 [2019-11-20 02:05:39,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:39,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,822 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-20 02:05:39,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2019-11-20 02:05:39,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2019-11-20 02:05:39,881 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-20 02:05:39,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,892 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:39,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:39,905 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:32 [2019-11-20 02:05:40,009 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 02:05:40,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-20 02:05:40,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:40,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-20 02:05:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 714 proven. 91 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-11-20 02:05:40,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:05:40,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 02:05:40,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751924020] [2019-11-20 02:05:40,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:05:40,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:40,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:05:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:05:40,635 INFO L87 Difference]: Start difference. First operand 3366 states and 5200 transitions. Second operand 8 states. [2019-11-20 02:05:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:43,165 INFO L93 Difference]: Finished difference Result 12360 states and 19132 transitions. [2019-11-20 02:05:43,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:05:43,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 390 [2019-11-20 02:05:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:43,182 INFO L225 Difference]: With dead ends: 12360 [2019-11-20 02:05:43,183 INFO L226 Difference]: Without dead ends: 9013 [2019-11-20 02:05:43,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:05:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9013 states. [2019-11-20 02:05:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9013 to 7151. [2019-11-20 02:05:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-20 02:05:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11267 transitions. [2019-11-20 02:05:43,425 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11267 transitions. Word has length 390 [2019-11-20 02:05:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:43,425 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11267 transitions. [2019-11-20 02:05:43,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:05:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11267 transitions. [2019-11-20 02:05:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-20 02:05:43,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:43,445 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 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-20 02:05:43,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:05:43,660 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -10666121, now seen corresponding path program 1 times [2019-11-20 02:05:43,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:43,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701834395] [2019-11-20 02:05:43,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-11-20 02:05:43,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701834395] [2019-11-20 02:05:43,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:43,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:43,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878223334] [2019-11-20 02:05:43,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:43,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:43,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:43,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:43,992 INFO L87 Difference]: Start difference. First operand 7151 states and 11267 transitions. Second operand 4 states. [2019-11-20 02:05:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:44,601 INFO L93 Difference]: Finished difference Result 11458 states and 17889 transitions. [2019-11-20 02:05:44,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:44,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-11-20 02:05:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:44,617 INFO L225 Difference]: With dead ends: 11458 [2019-11-20 02:05:44,617 INFO L226 Difference]: Without dead ends: 7791 [2019-11-20 02:05:44,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-11-20 02:05:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7151. [2019-11-20 02:05:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-20 02:05:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11247 transitions. [2019-11-20 02:05:44,840 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11247 transitions. Word has length 399 [2019-11-20 02:05:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:44,841 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11247 transitions. [2019-11-20 02:05:44,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11247 transitions. [2019-11-20 02:05:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-11-20 02:05:44,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:44,856 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 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-20 02:05:44,856 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash -636572992, now seen corresponding path program 1 times [2019-11-20 02:05:44,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:44,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146623207] [2019-11-20 02:05:44,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-11-20 02:05:45,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146623207] [2019-11-20 02:05:45,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:45,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:45,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542317890] [2019-11-20 02:05:45,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:45,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:45,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:45,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:45,082 INFO L87 Difference]: Start difference. First operand 7151 states and 11247 transitions. Second operand 4 states. [2019-11-20 02:05:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:45,860 INFO L93 Difference]: Finished difference Result 11458 states and 17859 transitions. [2019-11-20 02:05:45,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:45,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 400 [2019-11-20 02:05:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:45,876 INFO L225 Difference]: With dead ends: 11458 [2019-11-20 02:05:45,876 INFO L226 Difference]: Without dead ends: 7791 [2019-11-20 02:05:45,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-11-20 02:05:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7151. [2019-11-20 02:05:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-20 02:05:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11227 transitions. [2019-11-20 02:05:46,083 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11227 transitions. Word has length 400 [2019-11-20 02:05:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:46,083 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11227 transitions. [2019-11-20 02:05:46,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:46,084 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11227 transitions. [2019-11-20 02:05:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-11-20 02:05:46,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:46,097 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 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-20 02:05:46,097 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash 226663922, now seen corresponding path program 1 times [2019-11-20 02:05:46,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:46,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644441947] [2019-11-20 02:05:46,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-11-20 02:05:46,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644441947] [2019-11-20 02:05:46,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:46,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:46,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143983074] [2019-11-20 02:05:46,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:46,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:46,501 INFO L87 Difference]: Start difference. First operand 7151 states and 11227 transitions. Second operand 4 states. [2019-11-20 02:05:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:47,116 INFO L93 Difference]: Finished difference Result 11458 states and 17829 transitions. [2019-11-20 02:05:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:47,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 401 [2019-11-20 02:05:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:47,131 INFO L225 Difference]: With dead ends: 11458 [2019-11-20 02:05:47,132 INFO L226 Difference]: Without dead ends: 7791 [2019-11-20 02:05:47,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-11-20 02:05:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7151. [2019-11-20 02:05:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-20 02:05:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11207 transitions. [2019-11-20 02:05:47,336 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11207 transitions. Word has length 401 [2019-11-20 02:05:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:47,336 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11207 transitions. [2019-11-20 02:05:47,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11207 transitions. [2019-11-20 02:05:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-11-20 02:05:47,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:47,352 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 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-20 02:05:47,352 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash 8717915, now seen corresponding path program 1 times [2019-11-20 02:05:47,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:47,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964485180] [2019-11-20 02:05:47,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-11-20 02:05:47,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964485180] [2019-11-20 02:05:47,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:47,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:47,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436576874] [2019-11-20 02:05:47,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:47,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:47,584 INFO L87 Difference]: Start difference. First operand 7151 states and 11207 transitions. Second operand 4 states. [2019-11-20 02:05:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:48,281 INFO L93 Difference]: Finished difference Result 11358 states and 17679 transitions. [2019-11-20 02:05:48,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:48,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 402 [2019-11-20 02:05:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:48,295 INFO L225 Difference]: With dead ends: 11358 [2019-11-20 02:05:48,295 INFO L226 Difference]: Without dead ends: 7691 [2019-11-20 02:05:48,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2019-11-20 02:05:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 7151. [2019-11-20 02:05:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-20 02:05:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11187 transitions. [2019-11-20 02:05:48,518 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11187 transitions. Word has length 402 [2019-11-20 02:05:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:48,518 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11187 transitions. [2019-11-20 02:05:48,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11187 transitions. [2019-11-20 02:05:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-11-20 02:05:48,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:48,528 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:48,528 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:48,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1223182652, now seen corresponding path program 1 times [2019-11-20 02:05:48,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:48,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022588855] [2019-11-20 02:05:48,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-20 02:05:48,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022588855] [2019-11-20 02:05:48,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:48,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:05:48,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119126496] [2019-11-20 02:05:48,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:05:48,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:48,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:05:48,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:48,862 INFO L87 Difference]: Start difference. First operand 7151 states and 11187 transitions. Second operand 5 states. [2019-11-20 02:05:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:49,588 INFO L93 Difference]: Finished difference Result 16769 states and 26295 transitions. [2019-11-20 02:05:49,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:49,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2019-11-20 02:05:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:49,597 INFO L225 Difference]: With dead ends: 16769 [2019-11-20 02:05:49,597 INFO L226 Difference]: Without dead ends: 9637 [2019-11-20 02:05:49,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:05:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9637 states. [2019-11-20 02:05:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9637 to 7701. [2019-11-20 02:05:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-11-20 02:05:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 12167 transitions. [2019-11-20 02:05:49,753 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 12167 transitions. Word has length 405 [2019-11-20 02:05:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:49,753 INFO L462 AbstractCegarLoop]: Abstraction has 7701 states and 12167 transitions. [2019-11-20 02:05:49,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:05:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 12167 transitions. [2019-11-20 02:05:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-11-20 02:05:49,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:49,759 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:49,759 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:49,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:49,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1549537306, now seen corresponding path program 2 times [2019-11-20 02:05:49,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:49,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343961807] [2019-11-20 02:05:49,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2019-11-20 02:05:49,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343961807] [2019-11-20 02:05:49,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:49,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:05:49,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208238768] [2019-11-20 02:05:49,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:05:49,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:49,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:05:49,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:05:49,961 INFO L87 Difference]: Start difference. First operand 7701 states and 12167 transitions. Second operand 6 states. [2019-11-20 02:05:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:51,034 INFO L93 Difference]: Finished difference Result 19215 states and 30148 transitions. [2019-11-20 02:05:51,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:05:51,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 405 [2019-11-20 02:05:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:51,046 INFO L225 Difference]: With dead ends: 19215 [2019-11-20 02:05:51,046 INFO L226 Difference]: Without dead ends: 11533 [2019-11-20 02:05:51,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:05:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11533 states. [2019-11-20 02:05:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11533 to 8371. [2019-11-20 02:05:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8371 states. [2019-11-20 02:05:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8371 states to 8371 states and 13237 transitions. [2019-11-20 02:05:51,289 INFO L78 Accepts]: Start accepts. Automaton has 8371 states and 13237 transitions. Word has length 405 [2019-11-20 02:05:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:51,290 INFO L462 AbstractCegarLoop]: Abstraction has 8371 states and 13237 transitions. [2019-11-20 02:05:51,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:05:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8371 states and 13237 transitions. [2019-11-20 02:05:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-11-20 02:05:51,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:51,297 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:51,297 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:51,297 INFO L82 PathProgramCache]: Analyzing trace with hash 383945128, now seen corresponding path program 1 times [2019-11-20 02:05:51,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:51,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22045470] [2019-11-20 02:05:51,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1532 backedges. 860 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-20 02:05:51,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22045470] [2019-11-20 02:05:51,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:51,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:05:51,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498078231] [2019-11-20 02:05:51,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:05:51,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:51,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:05:51,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:51,620 INFO L87 Difference]: Start difference. First operand 8371 states and 13237 transitions. Second operand 5 states. [2019-11-20 02:05:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:52,364 INFO L93 Difference]: Finished difference Result 18349 states and 28842 transitions. [2019-11-20 02:05:52,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:52,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 406 [2019-11-20 02:05:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:52,372 INFO L225 Difference]: With dead ends: 18349 [2019-11-20 02:05:52,372 INFO L226 Difference]: Without dead ends: 9997 [2019-11-20 02:05:52,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:05:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9997 states. [2019-11-20 02:05:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9997 to 8461. [2019-11-20 02:05:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:05:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13357 transitions. [2019-11-20 02:05:52,557 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13357 transitions. Word has length 406 [2019-11-20 02:05:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:52,557 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13357 transitions. [2019-11-20 02:05:52,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:05:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13357 transitions. [2019-11-20 02:05:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-11-20 02:05:52,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:52,564 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:52,564 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:52,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1026115724, now seen corresponding path program 1 times [2019-11-20 02:05:52,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:52,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367812878] [2019-11-20 02:05:52,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-11-20 02:05:52,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367812878] [2019-11-20 02:05:52,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:52,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:52,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436945964] [2019-11-20 02:05:52,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:52,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:52,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:52,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:52,743 INFO L87 Difference]: Start difference. First operand 8461 states and 13357 transitions. Second operand 4 states. [2019-11-20 02:05:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:53,509 INFO L93 Difference]: Finished difference Result 14304 states and 22402 transitions. [2019-11-20 02:05:53,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:53,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2019-11-20 02:05:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:53,516 INFO L225 Difference]: With dead ends: 14304 [2019-11-20 02:05:53,517 INFO L226 Difference]: Without dead ends: 9817 [2019-11-20 02:05:53,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9817 states. [2019-11-20 02:05:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9817 to 8461. [2019-11-20 02:05:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:05:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13337 transitions. [2019-11-20 02:05:53,698 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13337 transitions. Word has length 407 [2019-11-20 02:05:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:53,699 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13337 transitions. [2019-11-20 02:05:53,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13337 transitions. [2019-11-20 02:05:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-20 02:05:53,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:53,708 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:53,708 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:53,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1129113554, now seen corresponding path program 1 times [2019-11-20 02:05:53,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:53,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915676737] [2019-11-20 02:05:53,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-11-20 02:05:53,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915676737] [2019-11-20 02:05:53,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:53,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:53,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789418610] [2019-11-20 02:05:53,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:53,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:53,905 INFO L87 Difference]: Start difference. First operand 8461 states and 13337 transitions. Second operand 4 states. [2019-11-20 02:05:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:54,707 INFO L93 Difference]: Finished difference Result 14304 states and 22372 transitions. [2019-11-20 02:05:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:54,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-11-20 02:05:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:54,715 INFO L225 Difference]: With dead ends: 14304 [2019-11-20 02:05:54,715 INFO L226 Difference]: Without dead ends: 9817 [2019-11-20 02:05:54,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9817 states. [2019-11-20 02:05:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9817 to 8461. [2019-11-20 02:05:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:05:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13317 transitions. [2019-11-20 02:05:54,898 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13317 transitions. Word has length 408 [2019-11-20 02:05:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:54,898 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13317 transitions. [2019-11-20 02:05:54,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13317 transitions. [2019-11-20 02:05:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-20 02:05:54,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:54,988 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:54,988 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:54,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:54,988 INFO L82 PathProgramCache]: Analyzing trace with hash -804582959, now seen corresponding path program 1 times [2019-11-20 02:05:54,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:54,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91708658] [2019-11-20 02:05:54,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-11-20 02:05:55,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91708658] [2019-11-20 02:05:55,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:55,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:55,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179293796] [2019-11-20 02:05:55,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:55,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:55,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:55,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:55,177 INFO L87 Difference]: Start difference. First operand 8461 states and 13317 transitions. Second operand 4 states. [2019-11-20 02:05:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:55,948 INFO L93 Difference]: Finished difference Result 14204 states and 22222 transitions. [2019-11-20 02:05:55,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:55,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2019-11-20 02:05:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:55,956 INFO L225 Difference]: With dead ends: 14204 [2019-11-20 02:05:55,956 INFO L226 Difference]: Without dead ends: 9717 [2019-11-20 02:05:55,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9717 states. [2019-11-20 02:05:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9717 to 8461. [2019-11-20 02:05:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:05:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13297 transitions. [2019-11-20 02:05:56,143 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13297 transitions. Word has length 409 [2019-11-20 02:05:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:56,143 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13297 transitions. [2019-11-20 02:05:56,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13297 transitions. [2019-11-20 02:05:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-20 02:05:56,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:56,150 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:56,151 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash -422950425, now seen corresponding path program 1 times [2019-11-20 02:05:56,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:56,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382496687] [2019-11-20 02:05:56,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 577 proven. 0 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2019-11-20 02:05:56,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382496687] [2019-11-20 02:05:56,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:56,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:56,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136463925] [2019-11-20 02:05:56,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:56,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:56,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:56,350 INFO L87 Difference]: Start difference. First operand 8461 states and 13297 transitions. Second operand 4 states. [2019-11-20 02:05:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:56,965 INFO L93 Difference]: Finished difference Result 18159 states and 28409 transitions. [2019-11-20 02:05:56,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:56,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 419 [2019-11-20 02:05:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:56,973 INFO L225 Difference]: With dead ends: 18159 [2019-11-20 02:05:56,973 INFO L226 Difference]: Without dead ends: 9717 [2019-11-20 02:05:56,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9717 states. [2019-11-20 02:05:57,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9717 to 8461. [2019-11-20 02:05:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:05:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13277 transitions. [2019-11-20 02:05:57,154 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13277 transitions. Word has length 419 [2019-11-20 02:05:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:57,154 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13277 transitions. [2019-11-20 02:05:57,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13277 transitions. [2019-11-20 02:05:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-20 02:05:57,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:57,161 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:57,161 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:57,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:57,162 INFO L82 PathProgramCache]: Analyzing trace with hash -517020184, now seen corresponding path program 1 times [2019-11-20 02:05:57,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:57,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371812918] [2019-11-20 02:05:57,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2019-11-20 02:05:57,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371812918] [2019-11-20 02:05:57,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:57,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:57,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780996955] [2019-11-20 02:05:57,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:57,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:57,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:57,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:57,383 INFO L87 Difference]: Start difference. First operand 8461 states and 13277 transitions. Second operand 4 states. [2019-11-20 02:05:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:58,128 INFO L93 Difference]: Finished difference Result 18119 states and 28329 transitions. [2019-11-20 02:05:58,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:58,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-11-20 02:05:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:58,135 INFO L225 Difference]: With dead ends: 18119 [2019-11-20 02:05:58,136 INFO L226 Difference]: Without dead ends: 9677 [2019-11-20 02:05:58,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2019-11-20 02:05:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 8461. [2019-11-20 02:05:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:05:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13257 transitions. [2019-11-20 02:05:58,334 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13257 transitions. Word has length 420 [2019-11-20 02:05:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:58,334 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13257 transitions. [2019-11-20 02:05:58,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13257 transitions. [2019-11-20 02:05:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-20 02:05:58,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:58,341 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:58,342 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1050165976, now seen corresponding path program 1 times [2019-11-20 02:05:58,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:58,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148156913] [2019-11-20 02:05:58,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-11-20 02:05:58,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148156913] [2019-11-20 02:05:58,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:58,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:58,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016104104] [2019-11-20 02:05:58,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:58,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:58,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:58,544 INFO L87 Difference]: Start difference. First operand 8461 states and 13257 transitions. Second operand 4 states. [2019-11-20 02:05:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:59,154 INFO L93 Difference]: Finished difference Result 14004 states and 21692 transitions. [2019-11-20 02:05:59,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:59,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-11-20 02:05:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:59,162 INFO L225 Difference]: With dead ends: 14004 [2019-11-20 02:05:59,162 INFO L226 Difference]: Without dead ends: 9517 [2019-11-20 02:05:59,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:05:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9517 states. [2019-11-20 02:05:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9517 to 8461. [2019-11-20 02:05:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:05:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13237 transitions. [2019-11-20 02:05:59,353 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13237 transitions. Word has length 420 [2019-11-20 02:05:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:59,353 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13237 transitions. [2019-11-20 02:05:59,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13237 transitions. [2019-11-20 02:05:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-20 02:05:59,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:59,360 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:05:59,360 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2020552241, now seen corresponding path program 1 times [2019-11-20 02:05:59,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:05:59,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738152712] [2019-11-20 02:05:59,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:05:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-11-20 02:05:59,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738152712] [2019-11-20 02:05:59,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:05:59,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:05:59,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618001657] [2019-11-20 02:05:59,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:59,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:05:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:05:59,530 INFO L87 Difference]: Start difference. First operand 8461 states and 13237 transitions. Second operand 4 states. [2019-11-20 02:06:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:00,170 INFO L93 Difference]: Finished difference Result 14004 states and 21662 transitions. [2019-11-20 02:06:00,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:00,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-11-20 02:06:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:00,178 INFO L225 Difference]: With dead ends: 14004 [2019-11-20 02:06:00,178 INFO L226 Difference]: Without dead ends: 9517 [2019-11-20 02:06:00,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:06:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9517 states. [2019-11-20 02:06:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9517 to 8461. [2019-11-20 02:06:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13217 transitions. [2019-11-20 02:06:00,392 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13217 transitions. Word has length 421 [2019-11-20 02:06:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:00,392 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13217 transitions. [2019-11-20 02:06:00,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13217 transitions. [2019-11-20 02:06:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-11-20 02:06:00,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:00,399 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:00,399 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1891874509, now seen corresponding path program 1 times [2019-11-20 02:06:00,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:00,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019930154] [2019-11-20 02:06:00,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-11-20 02:06:00,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019930154] [2019-11-20 02:06:00,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:00,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:00,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153659208] [2019-11-20 02:06:00,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:00,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:00,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:00,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:00,705 INFO L87 Difference]: Start difference. First operand 8461 states and 13217 transitions. Second operand 4 states. [2019-11-20 02:06:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:01,710 INFO L93 Difference]: Finished difference Result 14004 states and 21632 transitions. [2019-11-20 02:06:01,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:01,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-11-20 02:06:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:01,718 INFO L225 Difference]: With dead ends: 14004 [2019-11-20 02:06:01,718 INFO L226 Difference]: Without dead ends: 9517 [2019-11-20 02:06:01,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:06:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9517 states. [2019-11-20 02:06:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9517 to 8461. [2019-11-20 02:06:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13197 transitions. [2019-11-20 02:06:01,923 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13197 transitions. Word has length 422 [2019-11-20 02:06:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:01,923 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13197 transitions. [2019-11-20 02:06:01,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13197 transitions. [2019-11-20 02:06:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-11-20 02:06:01,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:01,930 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:01,931 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:01,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:01,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1366170166, now seen corresponding path program 1 times [2019-11-20 02:06:01,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:01,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894788815] [2019-11-20 02:06:01,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-11-20 02:06:02,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894788815] [2019-11-20 02:06:02,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:02,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:02,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523562854] [2019-11-20 02:06:02,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:02,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:02,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:02,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:02,140 INFO L87 Difference]: Start difference. First operand 8461 states and 13197 transitions. Second operand 4 states. [2019-11-20 02:06:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:02,985 INFO L93 Difference]: Finished difference Result 13904 states and 21482 transitions. [2019-11-20 02:06:02,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:02,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 423 [2019-11-20 02:06:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:02,992 INFO L225 Difference]: With dead ends: 13904 [2019-11-20 02:06:02,993 INFO L226 Difference]: Without dead ends: 9417 [2019-11-20 02:06:02,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:06:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2019-11-20 02:06:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 8461. [2019-11-20 02:06:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13177 transitions. [2019-11-20 02:06:03,200 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13177 transitions. Word has length 423 [2019-11-20 02:06:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:03,200 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13177 transitions. [2019-11-20 02:06:03,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13177 transitions. [2019-11-20 02:06:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-11-20 02:06:03,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:03,207 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:03,207 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash 523241025, now seen corresponding path program 1 times [2019-11-20 02:06:03,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:03,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825974561] [2019-11-20 02:06:03,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1799 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2019-11-20 02:06:03,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825974561] [2019-11-20 02:06:03,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:03,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:03,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991525040] [2019-11-20 02:06:03,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:03,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:03,422 INFO L87 Difference]: Start difference. First operand 8461 states and 13177 transitions. Second operand 4 states. [2019-11-20 02:06:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:04,031 INFO L93 Difference]: Finished difference Result 17723 states and 27468 transitions. [2019-11-20 02:06:04,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:04,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 432 [2019-11-20 02:06:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:04,038 INFO L225 Difference]: With dead ends: 17723 [2019-11-20 02:06:04,039 INFO L226 Difference]: Without dead ends: 9281 [2019-11-20 02:06:04,043 INFO L630 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-20 02:06:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2019-11-20 02:06:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 8461. [2019-11-20 02:06:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13157 transitions. [2019-11-20 02:06:04,301 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13157 transitions. Word has length 432 [2019-11-20 02:06:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:04,301 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13157 transitions. [2019-11-20 02:06:04,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13157 transitions. [2019-11-20 02:06:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-20 02:06:04,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:04,312 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:04,312 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1877619336, now seen corresponding path program 1 times [2019-11-20 02:06:04,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:04,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401810333] [2019-11-20 02:06:04,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 571 proven. 0 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2019-11-20 02:06:04,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401810333] [2019-11-20 02:06:04,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:04,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:04,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674563495] [2019-11-20 02:06:04,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:04,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:04,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:04,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:04,690 INFO L87 Difference]: Start difference. First operand 8461 states and 13157 transitions. Second operand 4 states. [2019-11-20 02:06:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:05,429 INFO L93 Difference]: Finished difference Result 17683 states and 27388 transitions. [2019-11-20 02:06:05,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:05,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-11-20 02:06:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:05,435 INFO L225 Difference]: With dead ends: 17683 [2019-11-20 02:06:05,435 INFO L226 Difference]: Without dead ends: 9241 [2019-11-20 02:06:05,439 INFO L630 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-20 02:06:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9241 states. [2019-11-20 02:06:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9241 to 8461. [2019-11-20 02:06:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13137 transitions. [2019-11-20 02:06:05,621 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13137 transitions. Word has length 433 [2019-11-20 02:06:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:05,621 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13137 transitions. [2019-11-20 02:06:05,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13137 transitions. [2019-11-20 02:06:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-20 02:06:05,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:05,628 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:05,628 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:05,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2141119759, now seen corresponding path program 1 times [2019-11-20 02:06:05,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:05,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031020392] [2019-11-20 02:06:05,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-11-20 02:06:05,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031020392] [2019-11-20 02:06:05,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:05,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:05,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144004522] [2019-11-20 02:06:05,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:05,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:05,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:05,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:05,819 INFO L87 Difference]: Start difference. First operand 8461 states and 13137 transitions. Second operand 4 states. [2019-11-20 02:06:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:06,382 INFO L93 Difference]: Finished difference Result 17623 states and 27268 transitions. [2019-11-20 02:06:06,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:06,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-11-20 02:06:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:06,389 INFO L225 Difference]: With dead ends: 17623 [2019-11-20 02:06:06,390 INFO L226 Difference]: Without dead ends: 9181 [2019-11-20 02:06:06,396 INFO L630 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-20 02:06:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9181 states. [2019-11-20 02:06:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9181 to 8461. [2019-11-20 02:06:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13117 transitions. [2019-11-20 02:06:06,616 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13117 transitions. Word has length 433 [2019-11-20 02:06:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:06,616 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13117 transitions. [2019-11-20 02:06:06,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13117 transitions. [2019-11-20 02:06:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-20 02:06:06,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:06,623 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:06,623 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:06,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1372839948, now seen corresponding path program 1 times [2019-11-20 02:06:06,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:06,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253450840] [2019-11-20 02:06:06,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1841 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2019-11-20 02:06:06,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253450840] [2019-11-20 02:06:06,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:06,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:06,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347928107] [2019-11-20 02:06:06,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:06,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:06,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:06,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:06,832 INFO L87 Difference]: Start difference. First operand 8461 states and 13117 transitions. Second operand 4 states. [2019-11-20 02:06:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:07,875 INFO L93 Difference]: Finished difference Result 17859 states and 27489 transitions. [2019-11-20 02:06:07,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:07,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-11-20 02:06:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:07,884 INFO L225 Difference]: With dead ends: 17859 [2019-11-20 02:06:07,885 INFO L226 Difference]: Without dead ends: 9417 [2019-11-20 02:06:07,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:06:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2019-11-20 02:06:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 8461. [2019-11-20 02:06:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13097 transitions. [2019-11-20 02:06:08,237 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13097 transitions. Word has length 433 [2019-11-20 02:06:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:08,237 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13097 transitions. [2019-11-20 02:06:08,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13097 transitions. [2019-11-20 02:06:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-20 02:06:08,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:08,244 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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-20 02:06:08,244 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:08,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1891149376, now seen corresponding path program 1 times [2019-11-20 02:06:08,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:08,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890810312] [2019-11-20 02:06:08,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2019-11-20 02:06:08,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890810312] [2019-11-20 02:06:08,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:08,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:08,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666911754] [2019-11-20 02:06:08,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:08,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:08,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:08,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:08,516 INFO L87 Difference]: Start difference. First operand 8461 states and 13097 transitions. Second operand 4 states. [2019-11-20 02:06:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:09,134 INFO L93 Difference]: Finished difference Result 17859 states and 27449 transitions. [2019-11-20 02:06:09,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:09,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-11-20 02:06:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:09,141 INFO L225 Difference]: With dead ends: 17859 [2019-11-20 02:06:09,142 INFO L226 Difference]: Without dead ends: 9417 [2019-11-20 02:06:09,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:06:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2019-11-20 02:06:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 8461. [2019-11-20 02:06:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13077 transitions. [2019-11-20 02:06:09,340 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13077 transitions. Word has length 433 [2019-11-20 02:06:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:09,341 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13077 transitions. [2019-11-20 02:06:09,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13077 transitions. [2019-11-20 02:06:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-20 02:06:09,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:09,347 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 10, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:09,347 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -6909596, now seen corresponding path program 1 times [2019-11-20 02:06:09,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:09,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473921078] [2019-11-20 02:06:09,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2019-11-20 02:06:09,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473921078] [2019-11-20 02:06:09,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:09,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:09,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955935923] [2019-11-20 02:06:09,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:09,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:09,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:09,508 INFO L87 Difference]: Start difference. First operand 8461 states and 13077 transitions. Second operand 4 states. [2019-11-20 02:06:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:09,988 INFO L93 Difference]: Finished difference Result 17203 states and 26546 transitions. [2019-11-20 02:06:09,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:09,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-11-20 02:06:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:09,997 INFO L225 Difference]: With dead ends: 17203 [2019-11-20 02:06:09,998 INFO L226 Difference]: Without dead ends: 8761 [2019-11-20 02:06:10,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:06:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8761 states. [2019-11-20 02:06:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8761 to 8461. [2019-11-20 02:06:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13057 transitions. [2019-11-20 02:06:10,210 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13057 transitions. Word has length 433 [2019-11-20 02:06:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:10,211 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13057 transitions. [2019-11-20 02:06:10,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13057 transitions. [2019-11-20 02:06:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-11-20 02:06:10,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:10,216 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:10,216 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:10,217 INFO L82 PathProgramCache]: Analyzing trace with hash -682093469, now seen corresponding path program 1 times [2019-11-20 02:06:10,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:10,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14561550] [2019-11-20 02:06:10,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1854 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2019-11-20 02:06:10,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14561550] [2019-11-20 02:06:10,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:10,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:10,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736754358] [2019-11-20 02:06:10,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:10,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:10,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:10,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:10,393 INFO L87 Difference]: Start difference. First operand 8461 states and 13057 transitions. Second operand 4 states. [2019-11-20 02:06:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:11,012 INFO L93 Difference]: Finished difference Result 17819 states and 27329 transitions. [2019-11-20 02:06:11,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:11,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-11-20 02:06:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:11,020 INFO L225 Difference]: With dead ends: 17819 [2019-11-20 02:06:11,020 INFO L226 Difference]: Without dead ends: 9377 [2019-11-20 02:06:11,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:06:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2019-11-20 02:06:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 8461. [2019-11-20 02:06:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13037 transitions. [2019-11-20 02:06:11,282 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13037 transitions. Word has length 434 [2019-11-20 02:06:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:11,282 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13037 transitions. [2019-11-20 02:06:11,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13037 transitions. [2019-11-20 02:06:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-11-20 02:06:11,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:11,292 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:11,292 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1745105630, now seen corresponding path program 1 times [2019-11-20 02:06:11,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:11,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061121764] [2019-11-20 02:06:11,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2019-11-20 02:06:11,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061121764] [2019-11-20 02:06:11,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:11,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:06:11,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001357343] [2019-11-20 02:06:11,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:11,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:06:11,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:11,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:11,730 INFO L87 Difference]: Start difference. First operand 8461 states and 13037 transitions. Second operand 4 states. [2019-11-20 02:06:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:12,488 INFO L93 Difference]: Finished difference Result 17723 states and 27168 transitions. [2019-11-20 02:06:12,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:12,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-11-20 02:06:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:12,497 INFO L225 Difference]: With dead ends: 17723 [2019-11-20 02:06:12,497 INFO L226 Difference]: Without dead ends: 9281 [2019-11-20 02:06:12,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:06:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2019-11-20 02:06:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 8461. [2019-11-20 02:06:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-20 02:06:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13017 transitions. [2019-11-20 02:06:12,721 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13017 transitions. Word has length 434 [2019-11-20 02:06:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:12,721 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13017 transitions. [2019-11-20 02:06:12,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13017 transitions. [2019-11-20 02:06:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-11-20 02:06:12,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:12,729 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:06:12,729 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1410848715, now seen corresponding path program 1 times [2019-11-20 02:06:12,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:06:12,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944360658] [2019-11-20 02:06:12,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:06:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 598 proven. 164 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2019-11-20 02:06:13,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944360658] [2019-11-20 02:06:13,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386466454] [2019-11-20 02:06:13,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:06:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:13,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 02:06:13,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:13,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 02:06:13,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:06:13,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:13,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:06:13,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 02:06:13,593 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_161|], 5=[|v_#memory_int_179|]} [2019-11-20 02:06:13,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-11-20 02:06:13,596 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:13,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:13,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2019-11-20 02:06:13,603 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:13,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:13,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:13,647 INFO L377 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-20 02:06:13,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:06:13,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:06:13,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:06:13,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:06:13,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:06:13,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:06:13,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:06:13,860 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-20 02:06:13,864 INFO L168 Benchmark]: Toolchain (without parser) took 71203.50 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 939.3 MB in the beginning and 1.9 GB in the end (delta: -961.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-20 02:06:13,864 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:06:13,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:13,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:13,865 INFO L168 Benchmark]: Boogie Preprocessor took 122.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:13,865 INFO L168 Benchmark]: RCFGBuilder took 1495.19 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:13,866 INFO L168 Benchmark]: TraceAbstraction took 68681.64 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -899.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-20 02:06:13,868 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 803.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 122.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1495.19 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68681.64 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -899.9 MB). Peak memory consumption was 1.0 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-678e011 [2019-11-20 02:06:15,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:06:15,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:06:15,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:06:15,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:06:15,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:06:15,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:06:15,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:06:15,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:06:15,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:06:15,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:06:15,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:06:15,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:06:15,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:06:15,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:06:15,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:06:15,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:06:15,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:06:15,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:06:15,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:06:15,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:06:15,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:06:15,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:06:15,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:06:15,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:06:16,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:06:16,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:06:16,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:06:16,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:06:16,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:06:16,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:06:16,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:06:16,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:06:16,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:06:16,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:06:16,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:06:16,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:06:16,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:06:16,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:06:16,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:06:16,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:06:16,021 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 02:06:16,042 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:06:16,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:06:16,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:06:16,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:06:16,045 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:06:16,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:06:16,045 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:06:16,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:06:16,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:06:16,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:06:16,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:06:16,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:06:16,048 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 02:06:16,048 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 02:06:16,049 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:06:16,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:06:16,049 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:06:16,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:06:16,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:06:16,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:06:16,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:06:16,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:06:16,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:06:16,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:06:16,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:06:16,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:06:16,052 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 02:06:16,053 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 02:06:16,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:06:16,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 02:06:16,054 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_8f698512-62a9-47be-8268-1e81b45f119d/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 -> e83cf3c2949f89871817218ec6b0742e2a7cf269 [2019-11-20 02:06:16,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:06:16,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:06:16,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:06:16,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:06:16,480 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:06:16,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-11-20 02:06:16,542 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data/3ea9a931f/b0823d6bb941431abc4683951145f615/FLAGbe2d4e59d [2019-11-20 02:06:17,082 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:06:17,083 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-11-20 02:06:17,106 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data/3ea9a931f/b0823d6bb941431abc4683951145f615/FLAGbe2d4e59d [2019-11-20 02:06:17,371 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/data/3ea9a931f/b0823d6bb941431abc4683951145f615 [2019-11-20 02:06:17,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:06:17,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:06:17,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:06:17,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:06:17,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:06:17,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:06:17" (1/1) ... [2019-11-20 02:06:17,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7895ccec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:17, skipping insertion in model container [2019-11-20 02:06:17,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:06:17" (1/1) ... [2019-11-20 02:06:17,393 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:06:17,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:06:18,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:06:18,164 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:06:18,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:06:18,298 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:06:18,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18 WrapperNode [2019-11-20 02:06:18,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:06:18,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:06:18,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:06:18,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:06:18,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... [2019-11-20 02:06:18,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... [2019-11-20 02:06:18,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:06:18,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:06:18,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:06:18,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:06:18,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... [2019-11-20 02:06:18,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... [2019-11-20 02:06:18,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... [2019-11-20 02:06:18,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... [2019-11-20 02:06:18,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... [2019-11-20 02:06:18,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... [2019-11-20 02:06:18,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... [2019-11-20 02:06:18,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:06:18,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:06:18,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:06:18,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:06:18,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:06:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 02:06:18,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:06:18,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 02:06:18,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 02:06:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 02:06:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:06:18,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:06:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 02:06:18,984 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:06:22,117 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 02:06:22,117 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 02:06:22,118 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:06:22,119 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 02:06:22,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:06:22 BoogieIcfgContainer [2019-11-20 02:06:22,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:06:22,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:06:22,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:06:22,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:06:22,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:06:17" (1/3) ... [2019-11-20 02:06:22,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35bb047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:06:22, skipping insertion in model container [2019-11-20 02:06:22,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:06:18" (2/3) ... [2019-11-20 02:06:22,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35bb047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:06:22, skipping insertion in model container [2019-11-20 02:06:22,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:06:22" (3/3) ... [2019-11-20 02:06:22,129 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2019-11-20 02:06:22,140 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:06:22,148 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:06:22,161 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:06:22,189 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:06:22,190 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:06:22,190 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:06:22,190 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:06:22,190 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:06:22,191 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:06:22,191 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:06:22,191 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:06:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-20 02:06:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 02:06:22,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:22,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:06:22,222 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash 557483936, now seen corresponding path program 1 times [2019-11-20 02:06:22,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:22,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1291926258] [2019-11-20 02:06:22,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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-20 02:06:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:22,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:06:22,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:06:22,534 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:06:22,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1291926258] [2019-11-20 02:06:22,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:22,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:06:22,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796769316] [2019-11-20 02:06:22,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:22,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:22,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:22,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:22,583 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-11-20 02:06:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:22,860 INFO L93 Difference]: Finished difference Result 572 states and 981 transitions. [2019-11-20 02:06:22,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:22,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-20 02:06:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:22,890 INFO L225 Difference]: With dead ends: 572 [2019-11-20 02:06:22,891 INFO L226 Difference]: Without dead ends: 390 [2019-11-20 02:06:22,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 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-20 02:06:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-20 02:06:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2019-11-20 02:06:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-11-20 02:06:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 596 transitions. [2019-11-20 02:06:22,967 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 596 transitions. Word has length 42 [2019-11-20 02:06:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:22,968 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 596 transitions. [2019-11-20 02:06:22,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 596 transitions. [2019-11-20 02:06:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 02:06:22,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:22,976 INFO L410 BasicCegarLoop]: trace histogram [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, 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-20 02:06:23,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:23,189 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:23,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2090002076, now seen corresponding path program 1 times [2019-11-20 02:06:23,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:23,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [724632390] [2019-11-20 02:06:23,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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-20 02:06:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:23,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:06:23,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:06:23,527 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:06:23,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724632390] [2019-11-20 02:06:23,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:23,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:06:23,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693200623] [2019-11-20 02:06:23,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:23,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:23,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:23,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:23,567 INFO L87 Difference]: Start difference. First operand 390 states and 596 transitions. Second operand 4 states. [2019-11-20 02:06:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:24,351 INFO L93 Difference]: Finished difference Result 895 states and 1386 transitions. [2019-11-20 02:06:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:24,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-20 02:06:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:24,359 INFO L225 Difference]: With dead ends: 895 [2019-11-20 02:06:24,359 INFO L226 Difference]: Without dead ends: 640 [2019-11-20 02:06:24,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 200 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-20 02:06:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-20 02:06:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-11-20 02:06:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-11-20 02:06:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 974 transitions. [2019-11-20 02:06:24,440 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 974 transitions. Word has length 102 [2019-11-20 02:06:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:24,442 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 974 transitions. [2019-11-20 02:06:24,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 974 transitions. [2019-11-20 02:06:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 02:06:24,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:24,492 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:06:24,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:24,693 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:24,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1625612872, now seen corresponding path program 1 times [2019-11-20 02:06:24,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:24,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1765058622] [2019-11-20 02:06:24,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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-20 02:06:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:25,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:06:25,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 02:06:25,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 02:06:25,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1765058622] [2019-11-20 02:06:25,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:25,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:06:25,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593166348] [2019-11-20 02:06:25,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:25,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:25,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:25,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:25,187 INFO L87 Difference]: Start difference. First operand 640 states and 974 transitions. Second operand 4 states. [2019-11-20 02:06:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:25,723 INFO L93 Difference]: Finished difference Result 1398 states and 2145 transitions. [2019-11-20 02:06:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:25,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-20 02:06:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:25,734 INFO L225 Difference]: With dead ends: 1398 [2019-11-20 02:06:25,735 INFO L226 Difference]: Without dead ends: 893 [2019-11-20 02:06:25,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 326 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-20 02:06:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-11-20 02:06:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2019-11-20 02:06:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-11-20 02:06:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1355 transitions. [2019-11-20 02:06:25,790 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1355 transitions. Word has length 165 [2019-11-20 02:06:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:25,791 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1355 transitions. [2019-11-20 02:06:25,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1355 transitions. [2019-11-20 02:06:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-20 02:06:25,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:25,797 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-20 02:06:25,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:26,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:26,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:26,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1436171483, now seen corresponding path program 1 times [2019-11-20 02:06:26,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:26,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1745213731] [2019-11-20 02:06:26,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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-20 02:06:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:26,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:06:26,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 02:06:26,497 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 02:06:26,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1745213731] [2019-11-20 02:06:26,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:26,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:06:26,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680741455] [2019-11-20 02:06:26,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:26,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:26,598 INFO L87 Difference]: Start difference. First operand 893 states and 1355 transitions. Second operand 4 states. [2019-11-20 02:06:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:27,494 INFO L93 Difference]: Finished difference Result 1902 states and 2902 transitions. [2019-11-20 02:06:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:27,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-20 02:06:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:27,504 INFO L225 Difference]: With dead ends: 1902 [2019-11-20 02:06:27,504 INFO L226 Difference]: Without dead ends: 1144 [2019-11-20 02:06:27,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 452 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-20 02:06:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-11-20 02:06:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2019-11-20 02:06:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-11-20 02:06:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1731 transitions. [2019-11-20 02:06:27,559 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1731 transitions. Word has length 228 [2019-11-20 02:06:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:27,560 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 1731 transitions. [2019-11-20 02:06:27,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1731 transitions. [2019-11-20 02:06:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-20 02:06:27,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:27,567 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-20 02:06:27,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:27,771 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:27,771 INFO L82 PathProgramCache]: Analyzing trace with hash 232931248, now seen corresponding path program 1 times [2019-11-20 02:06:27,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:27,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [562429461] [2019-11-20 02:06:27,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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-20 02:06:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:28,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:06:28,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-11-20 02:06:28,280 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-11-20 02:06:28,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [562429461] [2019-11-20 02:06:28,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:28,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:06:28,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322988291] [2019-11-20 02:06:28,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:28,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:28,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:28,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:28,370 INFO L87 Difference]: Start difference. First operand 1144 states and 1731 transitions. Second operand 4 states. [2019-11-20 02:06:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:29,101 INFO L93 Difference]: Finished difference Result 2407 states and 3656 transitions. [2019-11-20 02:06:29,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:29,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2019-11-20 02:06:29,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:29,113 INFO L225 Difference]: With dead ends: 2407 [2019-11-20 02:06:29,113 INFO L226 Difference]: Without dead ends: 1398 [2019-11-20 02:06:29,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 580 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-20 02:06:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2019-11-20 02:06:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2019-11-20 02:06:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2019-11-20 02:06:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2109 transitions. [2019-11-20 02:06:29,196 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2109 transitions. Word has length 292 [2019-11-20 02:06:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:29,197 INFO L462 AbstractCegarLoop]: Abstraction has 1398 states and 2109 transitions. [2019-11-20 02:06:29,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2109 transitions. [2019-11-20 02:06:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-20 02:06:29,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:29,208 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:06:29,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:29,412 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash 303911324, now seen corresponding path program 1 times [2019-11-20 02:06:29,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:29,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [219068011] [2019-11-20 02:06:29,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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-20 02:06:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:29,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:06:29,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-20 02:06:30,089 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-20 02:06:30,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [219068011] [2019-11-20 02:06:30,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:30,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:06:30,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984220317] [2019-11-20 02:06:30,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:06:30,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:30,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:06:30,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:06:30,207 INFO L87 Difference]: Start difference. First operand 1398 states and 2109 transitions. Second operand 4 states. [2019-11-20 02:06:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:31,492 INFO L93 Difference]: Finished difference Result 2912 states and 4405 transitions. [2019-11-20 02:06:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:06:31,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 356 [2019-11-20 02:06:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:31,505 INFO L225 Difference]: With dead ends: 2912 [2019-11-20 02:06:31,505 INFO L226 Difference]: Without dead ends: 1649 [2019-11-20 02:06:31,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 708 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-20 02:06:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-11-20 02:06:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-11-20 02:06:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-11-20 02:06:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2481 transitions. [2019-11-20 02:06:31,595 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2481 transitions. Word has length 356 [2019-11-20 02:06:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:31,595 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2481 transitions. [2019-11-20 02:06:31,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:06:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2481 transitions. [2019-11-20 02:06:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-20 02:06:31,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:31,605 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 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-20 02:06:31,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:31,817 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:31,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash 803618532, now seen corresponding path program 1 times [2019-11-20 02:06:31,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:31,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1539845119] [2019-11-20 02:06:31,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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-20 02:06:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:37,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:06:37,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:37,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:06:37,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:06:37,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:37,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:06:37,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 02:06:37,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:06:37,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-20 02:06:37,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:06:37,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:37,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:06:37,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 02:06:37,337 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:37,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 02:06:37,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:06:37,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:37,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:06:37,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2019-11-20 02:06:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-11-20 02:06:37,659 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-11-20 02:06:37,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1539845119] [2019-11-20 02:06:37,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:37,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-20 02:06:37,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070673572] [2019-11-20 02:06:37,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:06:37,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:37,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:06:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:06:37,873 INFO L87 Difference]: Start difference. First operand 1649 states and 2481 transitions. Second operand 8 states. [2019-11-20 02:06:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:54,365 INFO L93 Difference]: Finished difference Result 7367 states and 11142 transitions. [2019-11-20 02:06:54,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:06:54,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 390 [2019-11-20 02:06:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:54,398 INFO L225 Difference]: With dead ends: 7367 [2019-11-20 02:06:54,398 INFO L226 Difference]: Without dead ends: 5726 [2019-11-20 02:06:54,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 772 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:06:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2019-11-20 02:06:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 2205. [2019-11-20 02:06:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-11-20 02:06:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3492 transitions. [2019-11-20 02:06:54,554 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3492 transitions. Word has length 390 [2019-11-20 02:06:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:54,555 INFO L462 AbstractCegarLoop]: Abstraction has 2205 states and 3492 transitions. [2019-11-20 02:06:54,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:06:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3492 transitions. [2019-11-20 02:06:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-20 02:06:54,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:54,568 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 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-20 02:06:54,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:54,782 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1750656418, now seen corresponding path program 1 times [2019-11-20 02:06:54,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:54,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1748613556] [2019-11-20 02:06:54,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f698512-62a9-47be-8268-1e81b45f119d/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-20 02:07:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:07:07,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-20 02:07:07,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:07:07,983 INFO L377 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 10 treesize of output 8 [2019-11-20 02:07:07,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:09,614 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 02:07:09,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:09,620 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_211|, |v_#memory_$Pointer$.offset_211|], 2=[|v_#memory_$Pointer$.offset_205|, |v_#memory_$Pointer$.offset_206|, |v_#memory_$Pointer$.base_206|, |v_#memory_$Pointer$.base_205|]} [2019-11-20 02:07:09,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:09,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:09,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:09,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:09,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:10,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:10,095 INFO L237 Elim1Store]: Index analysis took 361 ms [2019-11-20 02:07:10,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-20 02:07:10,633 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:11,784 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 02:07:11,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:11,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:11,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:11,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:11,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:11,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:11,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:12,041 INFO L237 Elim1Store]: Index analysis took 199 ms [2019-11-20 02:07:12,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-20 02:07:12,231 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,032 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 02:07:13,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:13,043 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-20 02:07:13,407 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 02:07:13,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:13,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 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-20 02:07:13,487 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,644 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 02:07:13,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:13,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:07:13,674 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:13,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:07:13,769 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:13,828 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-20 02:07:13,829 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-20 02:07:13,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 02:07:13,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:13,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:07:13,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:13,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 02:07:13,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 02:07:13,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:13,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:07:13,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:13,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:13,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 02:07:13,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:13,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:07:13,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:07:14,093 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,142 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-20 02:07:14,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 02:07:14,174 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,185 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 02:07:14,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:07:14,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-20 02:07:14,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 02:07:14,316 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,337 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:42 [2019-11-20 02:07:14,363 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_216|, |v_#memory_$Pointer$.base_216|], 6=[|v_#memory_int_228|]} [2019-11-20 02:07:14,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:07:14,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 02:07:14,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-11-20 02:07:14,473 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:14,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:14,502 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:51 [2019-11-20 02:07:14,542 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_217|, |v_#memory_$Pointer$.base_208|, |v_#memory_$Pointer$.offset_208|, |v_#memory_$Pointer$.base_217|], 18=[|v_#memory_int_229|]} [2019-11-20 02:07:14,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:14,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:07:14,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:15,107 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 02:07:15,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:15,111 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:15,344 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 02:07:15,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:15,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:07:15,372 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:15,500 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 02:07:15,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:15,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 02:07:15,518 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:15,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:15,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-11-20 02:07:15,619 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:15,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:15,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:15,656 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:145, output treesize:51 [2019-11-20 02:07:15,704 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_218|, |v_#memory_$Pointer$.base_218|], 12=[|v_#memory_int_230|]} [2019-11-20 02:07:15,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 105 [2019-11-20 02:07:15,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:15,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:15,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 63 [2019-11-20 02:07:15,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:15,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:15,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:15,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2019-11-20 02:07:15,793 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:15,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:15,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:15,824 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:180, output treesize:72 [2019-11-20 02:07:15,873 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_209|, |v_#memory_$Pointer$.base_219|, |v_#memory_$Pointer$.offset_219|, |v_#memory_$Pointer$.offset_209|], 28=[|v_#memory_int_231|]} [2019-11-20 02:07:15,883 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:16,549 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-20 02:07:16,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:16,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:16,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:16,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:16,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2019-11-20 02:07:16,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:16,850 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 02:07:16,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:16,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:16,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2019-11-20 02:07:16,879 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:16,992 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 02:07:16,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:17,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:07:17,005 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:17,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:17,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,082 INFO L377 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2019-11-20 02:07:17,082 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:17,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:17,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:17,117 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:166, output treesize:64 [2019-11-20 02:07:17,208 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_220|, |v_#memory_$Pointer$.base_220|], 20=[|v_#memory_int_232|]} [2019-11-20 02:07:17,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 105 [2019-11-20 02:07:17,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:17,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:17,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 70 [2019-11-20 02:07:17,293 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:17,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:17,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,339 INFO L377 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 [2019-11-20 02:07:17,339 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:17,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:17,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:17,368 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:193, output treesize:87 [2019-11-20 02:07:17,427 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_210|, |v_#memory_$Pointer$.offset_221|, |v_#memory_$Pointer$.base_210|, |v_#memory_$Pointer$.base_221|], 50=[|v_#memory_int_233|]} [2019-11-20 02:07:17,431 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:17,792 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-20 02:07:17,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:17,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2019-11-20 02:07:17,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:17,825 INFO L377 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 134 treesize of output 118 [2019-11-20 02:07:17,826 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:17,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:17,895 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:07:18,257 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 02:07:18,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:18,261 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-20 02:07:18,474 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-20 02:07:18,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:18,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 140 [2019-11-20 02:07:18,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:18,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:18,492 INFO L377 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 120 treesize of output 92 [2019-11-20 02:07:18,492 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-20 02:07:18,623 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 02:07:18,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:18,624 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:18,801 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 02:07:18,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:18,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:18,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:18,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:07:18,810 INFO L377 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2019-11-20 02:07:18,810 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 02:07:18,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:18,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:18,843 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:236, output treesize:61 [2019-11-20 02:07:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 798 proven. 150 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-11-20 02:07:19,650 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:07:19,831 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:19,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:19,876 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:19,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:19,913 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-20 02:07:19,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:169, output treesize:157 [2019-11-20 02:07:20,011 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:20,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:20,090 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:20,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:20,145 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-20 02:07:20,145 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:481, output treesize:549 [2019-11-20 02:07:22,328 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_209|, |v_#memory_$Pointer$.offset_209|], 6=[|v_#memory_$Pointer$.base_234|, |v_#memory_$Pointer$.offset_234|]} [2019-11-20 02:07:22,381 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:22,868 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-20 02:07:22,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:22,885 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:23,225 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 02:07:23,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:23,229 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-20 02:07:23,467 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-20 02:07:23,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:23,470 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-20 02:07:23,632 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-20 02:07:23,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:23,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:23,633 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:869, output treesize:1391 [2019-11-20 02:07:25,066 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:25,322 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-20 02:07:25,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:25,324 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:25,442 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-20 02:07:25,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:25,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:25,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:1097, output treesize:2509 [2019-11-20 02:07:28,391 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_208|, |v_#memory_$Pointer$.offset_208|], 19=[|v_#memory_$Pointer$.offset_236|, |v_#memory_$Pointer$.base_236|]} [2019-11-20 02:07:28,479 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:30,434 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 104 [2019-11-20 02:07:30,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:30,480 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:31,662 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 99 [2019-11-20 02:07:31,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:31,667 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-20 02:07:32,688 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-20 02:07:32,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:32,695 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-20 02:07:33,414 WARN L191 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-20 02:07:33,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:07:33,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-20 02:07:33,416 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:3069, output treesize:6709 [2019-11-20 02:07:41,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:07:41,298 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-20 02:07:41,303 INFO L168 Benchmark]: Toolchain (without parser) took 83928.15 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 482.9 MB). Free memory was 952.4 MB in the beginning and 1.3 GB in the end (delta: -322.4 MB). Peak memory consumption was 160.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:07:41,303 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:07:41,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 922.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:07:41,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.20 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:07:41,307 INFO L168 Benchmark]: Boogie Preprocessor took 149.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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:07:41,310 INFO L168 Benchmark]: RCFGBuilder took 3581.22 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: 94.5 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:07:41,313 INFO L168 Benchmark]: TraceAbstraction took 79180.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -264.9 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:07:41,316 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 922.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.20 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 149.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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3581.22 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: 94.5 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79180.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -264.9 MB). Peak memory consumption was 70.1 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...