./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/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 3120445556e880fbad518fab0e301c4c6b39e1cb .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/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 3120445556e880fbad518fab0e301c4c6b39e1cb .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:23:42,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:23:42,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:23:42,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:23:42,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:23:42,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:23:42,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:23:42,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:23:42,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:23:42,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:23:42,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:23:42,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:23:42,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:23:42,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:23:42,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:23:42,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:23:42,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:23:42,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:23:42,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:23:42,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:23:42,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:23:42,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:23:42,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:23:42,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:23:42,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:23:42,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:23:42,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:23:42,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:23:42,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:23:42,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:23:42,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:23:42,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:23:42,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:23:42,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:23:42,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:23:42,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:23:42,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:23:42,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:23:42,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:23:42,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:23:42,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:23:42,506 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:23:42,515 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:23:42,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:23:42,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:23:42,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:23:42,516 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:23:42,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:23:42,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:23:42,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:23:42,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:23:42,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:23:42,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:23:42,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:23:42,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:23:42,517 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:23:42,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:23:42,518 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:23:42,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:23:42,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:23:42,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:23:42,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:23:42,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:23:42,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:23:42,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:23:42,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:23:42,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:23:42,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:23:42,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:23:42,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:23:42,519 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:23:42,519 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_22236261-f161-4d7c-8850-8b7fd0946764/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 -> 3120445556e880fbad518fab0e301c4c6b39e1cb [2019-12-07 11:23:42,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:23:42,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:23:42,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:23:42,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:23:42,634 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:23:42,634 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c [2019-12-07 11:23:42,679 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data/261485d93/063cc62f973547b5bdd4a39e38cf8b8b/FLAGa841d07f9 [2019-12-07 11:23:43,137 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:23:43,138 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c [2019-12-07 11:23:43,150 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data/261485d93/063cc62f973547b5bdd4a39e38cf8b8b/FLAGa841d07f9 [2019-12-07 11:23:43,472 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data/261485d93/063cc62f973547b5bdd4a39e38cf8b8b [2019-12-07 11:23:43,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:23:43,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:23:43,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:23:43,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:23:43,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:23:43,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:43,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5f4880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43, skipping insertion in model container [2019-12-07 11:23:43,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:43,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:23:43,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:23:43,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:23:43,833 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:23:43,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:23:43,911 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:23:43,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43 WrapperNode [2019-12-07 11:23:43,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:23:43,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:23:43,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:23:43,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:23:43,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:43,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:43,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:23:43,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:23:43,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:23:43,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:23:43,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:43,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:43,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:43,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:44,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:44,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:44,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... [2019-12-07 11:23:44,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:23:44,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:23:44,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:23:44,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:23:44,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:23:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:23:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:23:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:23:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:23:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:23:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:23:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:23:44,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:23:44,213 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:23:44,693 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 11:23:44,694 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 11:23:44,695 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:23:44,695 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:23:44,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:23:44 BoogieIcfgContainer [2019-12-07 11:23:44,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:23:44,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:23:44,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:23:44,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:23:44,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:23:43" (1/3) ... [2019-12-07 11:23:44,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1a6057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:23:44, skipping insertion in model container [2019-12-07 11:23:44,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:23:43" (2/3) ... [2019-12-07 11:23:44,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1a6057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:23:44, skipping insertion in model container [2019-12-07 11:23:44,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:23:44" (3/3) ... [2019-12-07 11:23:44,701 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-2.c [2019-12-07 11:23:44,708 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:23:44,714 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:23:44,722 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:23:44,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:23:44,740 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:23:44,740 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:23:44,740 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:23:44,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:23:44,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:23:44,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:23:44,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:23:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-12-07 11:23:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 11:23:44,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:44,763 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, 1, 1] [2019-12-07 11:23:44,763 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:44,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:44,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1128889191, now seen corresponding path program 1 times [2019-12-07 11:23:44,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:44,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123196859] [2019-12-07 11:23:44,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:44,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123196859] [2019-12-07 11:23:44,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:44,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:44,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593177449] [2019-12-07 11:23:44,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:44,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:44,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:44,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:44,979 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-12-07 11:23:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:45,297 INFO L93 Difference]: Finished difference Result 341 states and 583 transitions. [2019-12-07 11:23:45,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:45,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 11:23:45,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:45,309 INFO L225 Difference]: With dead ends: 341 [2019-12-07 11:23:45,309 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 11:23:45,313 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-12-07 11:23:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 11:23:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-12-07 11:23:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:23:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 244 transitions. [2019-12-07 11:23:45,354 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 244 transitions. Word has length 44 [2019-12-07 11:23:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:45,354 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 244 transitions. [2019-12-07 11:23:45,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2019-12-07 11:23:45,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:23:45,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:45,358 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, 1, 1] [2019-12-07 11:23:45,358 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:45,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:45,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1071790339, now seen corresponding path program 1 times [2019-12-07 11:23:45,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:45,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459164960] [2019-12-07 11:23:45,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:45,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459164960] [2019-12-07 11:23:45,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:45,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:45,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287946665] [2019-12-07 11:23:45,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:45,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:45,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:45,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:45,456 INFO L87 Difference]: Start difference. First operand 155 states and 244 transitions. Second operand 4 states. [2019-12-07 11:23:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:45,708 INFO L93 Difference]: Finished difference Result 308 states and 479 transitions. [2019-12-07 11:23:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:45,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 11:23:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:45,709 INFO L225 Difference]: With dead ends: 308 [2019-12-07 11:23:45,710 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 11:23:45,711 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-12-07 11:23:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 11:23:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-12-07 11:23:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:23:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 243 transitions. [2019-12-07 11:23:45,719 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 243 transitions. Word has length 57 [2019-12-07 11:23:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:45,719 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 243 transitions. [2019-12-07 11:23:45,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 243 transitions. [2019-12-07 11:23:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:23:45,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:45,721 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, 1, 1] [2019-12-07 11:23:45,721 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:45,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash -286614869, now seen corresponding path program 1 times [2019-12-07 11:23:45,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:45,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748772475] [2019-12-07 11:23:45,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:45,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748772475] [2019-12-07 11:23:45,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:45,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:45,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325876397] [2019-12-07 11:23:45,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:45,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:45,772 INFO L87 Difference]: Start difference. First operand 155 states and 243 transitions. Second operand 4 states. [2019-12-07 11:23:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:46,001 INFO L93 Difference]: Finished difference Result 307 states and 477 transitions. [2019-12-07 11:23:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:46,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 11:23:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:46,003 INFO L225 Difference]: With dead ends: 307 [2019-12-07 11:23:46,003 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 11:23:46,004 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-12-07 11:23:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 11:23:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2019-12-07 11:23:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:23:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 242 transitions. [2019-12-07 11:23:46,013 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 242 transitions. Word has length 58 [2019-12-07 11:23:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:46,013 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 242 transitions. [2019-12-07 11:23:46,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 242 transitions. [2019-12-07 11:23:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:23:46,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:46,015 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, 1, 1] [2019-12-07 11:23:46,015 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash -243286048, now seen corresponding path program 1 times [2019-12-07 11:23:46,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:46,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205993684] [2019-12-07 11:23:46,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:46,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205993684] [2019-12-07 11:23:46,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:46,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:46,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162895162] [2019-12-07 11:23:46,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:46,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:46,069 INFO L87 Difference]: Start difference. First operand 155 states and 242 transitions. Second operand 4 states. [2019-12-07 11:23:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:46,266 INFO L93 Difference]: Finished difference Result 305 states and 474 transitions. [2019-12-07 11:23:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:46,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 11:23:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:46,267 INFO L225 Difference]: With dead ends: 305 [2019-12-07 11:23:46,267 INFO L226 Difference]: Without dead ends: 169 [2019-12-07 11:23:46,268 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-12-07 11:23:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-12-07 11:23:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2019-12-07 11:23:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:23:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2019-12-07 11:23:46,274 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 58 [2019-12-07 11:23:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:46,274 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2019-12-07 11:23:46,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2019-12-07 11:23:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:23:46,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:46,275 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, 1, 1] [2019-12-07 11:23:46,275 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:46,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1727000736, now seen corresponding path program 1 times [2019-12-07 11:23:46,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:46,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171738810] [2019-12-07 11:23:46,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:46,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171738810] [2019-12-07 11:23:46,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:46,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:46,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47873262] [2019-12-07 11:23:46,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:46,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:46,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:46,318 INFO L87 Difference]: Start difference. First operand 155 states and 241 transitions. Second operand 4 states. [2019-12-07 11:23:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:46,497 INFO L93 Difference]: Finished difference Result 304 states and 472 transitions. [2019-12-07 11:23:46,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:46,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 11:23:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:46,498 INFO L225 Difference]: With dead ends: 304 [2019-12-07 11:23:46,498 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 11:23:46,498 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-12-07 11:23:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 11:23:46,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-12-07 11:23:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:23:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 240 transitions. [2019-12-07 11:23:46,504 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 240 transitions. Word has length 58 [2019-12-07 11:23:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:46,504 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 240 transitions. [2019-12-07 11:23:46,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 240 transitions. [2019-12-07 11:23:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:23:46,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:46,505 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, 1, 1] [2019-12-07 11:23:46,505 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1922150249, now seen corresponding path program 1 times [2019-12-07 11:23:46,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:46,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381385572] [2019-12-07 11:23:46,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:46,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381385572] [2019-12-07 11:23:46,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:46,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:46,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272891074] [2019-12-07 11:23:46,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:46,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:46,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:46,554 INFO L87 Difference]: Start difference. First operand 155 states and 240 transitions. Second operand 4 states. [2019-12-07 11:23:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:46,745 INFO L93 Difference]: Finished difference Result 304 states and 471 transitions. [2019-12-07 11:23:46,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:46,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 11:23:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:46,746 INFO L225 Difference]: With dead ends: 304 [2019-12-07 11:23:46,746 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 11:23:46,747 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-12-07 11:23:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 11:23:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-12-07 11:23:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:23:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2019-12-07 11:23:46,750 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 58 [2019-12-07 11:23:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:46,750 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2019-12-07 11:23:46,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2019-12-07 11:23:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:23:46,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:46,751 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, 1, 1] [2019-12-07 11:23:46,751 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash -909044396, now seen corresponding path program 1 times [2019-12-07 11:23:46,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:46,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118740281] [2019-12-07 11:23:46,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:46,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118740281] [2019-12-07 11:23:46,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:46,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:46,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837142520] [2019-12-07 11:23:46,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:46,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:46,787 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand 4 states. [2019-12-07 11:23:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:46,997 INFO L93 Difference]: Finished difference Result 304 states and 470 transitions. [2019-12-07 11:23:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:46,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 11:23:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:46,999 INFO L225 Difference]: With dead ends: 304 [2019-12-07 11:23:46,999 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 11:23:46,999 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-12-07 11:23:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 11:23:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-12-07 11:23:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:23:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2019-12-07 11:23:47,004 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 59 [2019-12-07 11:23:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:47,004 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2019-12-07 11:23:47,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2019-12-07 11:23:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:23:47,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:47,005 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, 1, 1] [2019-12-07 11:23:47,006 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash 985403794, now seen corresponding path program 1 times [2019-12-07 11:23:47,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:47,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785747041] [2019-12-07 11:23:47,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:47,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785747041] [2019-12-07 11:23:47,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:47,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:47,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206306224] [2019-12-07 11:23:47,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:47,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:47,047 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand 4 states. [2019-12-07 11:23:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:47,237 INFO L93 Difference]: Finished difference Result 304 states and 469 transitions. [2019-12-07 11:23:47,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:47,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 11:23:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:47,238 INFO L225 Difference]: With dead ends: 304 [2019-12-07 11:23:47,238 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 11:23:47,238 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-12-07 11:23:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 11:23:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-12-07 11:23:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:23:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 237 transitions. [2019-12-07 11:23:47,242 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 237 transitions. Word has length 60 [2019-12-07 11:23:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:47,242 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 237 transitions. [2019-12-07 11:23:47,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2019-12-07 11:23:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 11:23:47,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:47,243 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, 1, 1] [2019-12-07 11:23:47,243 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash 136693359, now seen corresponding path program 1 times [2019-12-07 11:23:47,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:47,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251773713] [2019-12-07 11:23:47,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:47,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251773713] [2019-12-07 11:23:47,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:47,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:47,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708524377] [2019-12-07 11:23:47,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:47,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:47,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:47,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:47,273 INFO L87 Difference]: Start difference. First operand 155 states and 237 transitions. Second operand 4 states. [2019-12-07 11:23:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:47,434 INFO L93 Difference]: Finished difference Result 294 states and 455 transitions. [2019-12-07 11:23:47,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:47,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 11:23:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:47,436 INFO L225 Difference]: With dead ends: 294 [2019-12-07 11:23:47,436 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 11:23:47,436 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-12-07 11:23:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 11:23:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2019-12-07 11:23:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 11:23:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 236 transitions. [2019-12-07 11:23:47,440 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 236 transitions. Word has length 61 [2019-12-07 11:23:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:47,440 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 236 transitions. [2019-12-07 11:23:47,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2019-12-07 11:23:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 11:23:47,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:47,441 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, 1, 1] [2019-12-07 11:23:47,441 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:47,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1651513849, now seen corresponding path program 1 times [2019-12-07 11:23:47,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:47,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937005926] [2019-12-07 11:23:47,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:47,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937005926] [2019-12-07 11:23:47,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:47,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:47,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491846000] [2019-12-07 11:23:47,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:47,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:47,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:47,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:47,482 INFO L87 Difference]: Start difference. First operand 155 states and 236 transitions. Second operand 4 states. [2019-12-07 11:23:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:47,713 INFO L93 Difference]: Finished difference Result 334 states and 516 transitions. [2019-12-07 11:23:47,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:47,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 11:23:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:47,714 INFO L225 Difference]: With dead ends: 334 [2019-12-07 11:23:47,714 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 11:23:47,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 11:23:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2019-12-07 11:23:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:23:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2019-12-07 11:23:47,719 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 61 [2019-12-07 11:23:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:47,719 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2019-12-07 11:23:47,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2019-12-07 11:23:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 11:23:47,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:47,720 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, 1, 1] [2019-12-07 11:23:47,720 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash -560551857, now seen corresponding path program 1 times [2019-12-07 11:23:47,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:47,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934579636] [2019-12-07 11:23:47,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:47,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934579636] [2019-12-07 11:23:47,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:47,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:47,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972243062] [2019-12-07 11:23:47,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:47,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:47,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:47,757 INFO L87 Difference]: Start difference. First operand 177 states and 274 transitions. Second operand 4 states. [2019-12-07 11:23:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:47,970 INFO L93 Difference]: Finished difference Result 356 states and 553 transitions. [2019-12-07 11:23:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:47,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 11:23:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:47,972 INFO L225 Difference]: With dead ends: 356 [2019-12-07 11:23:47,972 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 11:23:47,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 11:23:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2019-12-07 11:23:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:23:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 273 transitions. [2019-12-07 11:23:47,976 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 273 transitions. Word has length 74 [2019-12-07 11:23:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:47,976 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 273 transitions. [2019-12-07 11:23:47,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 273 transitions. [2019-12-07 11:23:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 11:23:47,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:47,977 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, 1, 1] [2019-12-07 11:23:47,977 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1618091111, now seen corresponding path program 1 times [2019-12-07 11:23:47,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:47,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470963727] [2019-12-07 11:23:47,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:48,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470963727] [2019-12-07 11:23:48,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:48,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:48,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50318382] [2019-12-07 11:23:48,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:48,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:48,007 INFO L87 Difference]: Start difference. First operand 177 states and 273 transitions. Second operand 4 states. [2019-12-07 11:23:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:48,260 INFO L93 Difference]: Finished difference Result 355 states and 550 transitions. [2019-12-07 11:23:48,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:48,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 11:23:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:48,262 INFO L225 Difference]: With dead ends: 355 [2019-12-07 11:23:48,262 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 11:23:48,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 11:23:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 177. [2019-12-07 11:23:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:23:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 272 transitions. [2019-12-07 11:23:48,268 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 272 transitions. Word has length 75 [2019-12-07 11:23:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:48,269 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 272 transitions. [2019-12-07 11:23:48,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 272 transitions. [2019-12-07 11:23:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 11:23:48,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:48,270 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, 1, 1] [2019-12-07 11:23:48,270 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1574762290, now seen corresponding path program 1 times [2019-12-07 11:23:48,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:48,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788848473] [2019-12-07 11:23:48,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:48,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788848473] [2019-12-07 11:23:48,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:48,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:48,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630891365] [2019-12-07 11:23:48,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:48,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:48,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:48,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:48,310 INFO L87 Difference]: Start difference. First operand 177 states and 272 transitions. Second operand 4 states. [2019-12-07 11:23:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:48,553 INFO L93 Difference]: Finished difference Result 353 states and 546 transitions. [2019-12-07 11:23:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:48,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 11:23:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:48,555 INFO L225 Difference]: With dead ends: 353 [2019-12-07 11:23:48,555 INFO L226 Difference]: Without dead ends: 195 [2019-12-07 11:23:48,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-07 11:23:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2019-12-07 11:23:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:23:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 271 transitions. [2019-12-07 11:23:48,560 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 271 transitions. Word has length 75 [2019-12-07 11:23:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:48,561 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 271 transitions. [2019-12-07 11:23:48,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 271 transitions. [2019-12-07 11:23:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 11:23:48,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:48,562 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, 1, 1] [2019-12-07 11:23:48,562 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:48,563 INFO L82 PathProgramCache]: Analyzing trace with hash 395524494, now seen corresponding path program 1 times [2019-12-07 11:23:48,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:48,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861784573] [2019-12-07 11:23:48,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:48,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861784573] [2019-12-07 11:23:48,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:48,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:48,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110069830] [2019-12-07 11:23:48,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:48,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:48,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:48,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:48,611 INFO L87 Difference]: Start difference. First operand 177 states and 271 transitions. Second operand 4 states. [2019-12-07 11:23:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:48,871 INFO L93 Difference]: Finished difference Result 352 states and 543 transitions. [2019-12-07 11:23:48,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:48,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 11:23:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:48,873 INFO L225 Difference]: With dead ends: 352 [2019-12-07 11:23:48,873 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 11:23:48,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 11:23:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2019-12-07 11:23:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:23:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 270 transitions. [2019-12-07 11:23:48,879 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 270 transitions. Word has length 75 [2019-12-07 11:23:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:48,879 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 270 transitions. [2019-12-07 11:23:48,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 270 transitions. [2019-12-07 11:23:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 11:23:48,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:48,880 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, 1, 1] [2019-12-07 11:23:48,880 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:48,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1041340805, now seen corresponding path program 1 times [2019-12-07 11:23:48,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:48,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269915546] [2019-12-07 11:23:48,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:48,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269915546] [2019-12-07 11:23:48,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:48,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:48,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838848520] [2019-12-07 11:23:48,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:48,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:48,916 INFO L87 Difference]: Start difference. First operand 177 states and 270 transitions. Second operand 4 states. [2019-12-07 11:23:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:49,160 INFO L93 Difference]: Finished difference Result 352 states and 541 transitions. [2019-12-07 11:23:49,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:49,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 11:23:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:49,161 INFO L225 Difference]: With dead ends: 352 [2019-12-07 11:23:49,161 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 11:23:49,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 11:23:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2019-12-07 11:23:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:23:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2019-12-07 11:23:49,165 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 75 [2019-12-07 11:23:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:49,165 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2019-12-07 11:23:49,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2019-12-07 11:23:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 11:23:49,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:49,165 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, 1, 1] [2019-12-07 11:23:49,165 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash 764865062, now seen corresponding path program 1 times [2019-12-07 11:23:49,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:49,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272551400] [2019-12-07 11:23:49,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:49,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272551400] [2019-12-07 11:23:49,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:49,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:49,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87217410] [2019-12-07 11:23:49,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:49,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:49,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:49,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:49,192 INFO L87 Difference]: Start difference. First operand 177 states and 269 transitions. Second operand 4 states. [2019-12-07 11:23:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:49,401 INFO L93 Difference]: Finished difference Result 352 states and 539 transitions. [2019-12-07 11:23:49,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:49,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 11:23:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:49,402 INFO L225 Difference]: With dead ends: 352 [2019-12-07 11:23:49,402 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 11:23:49,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 11:23:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2019-12-07 11:23:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:23:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 268 transitions. [2019-12-07 11:23:49,406 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 268 transitions. Word has length 76 [2019-12-07 11:23:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:49,406 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 268 transitions. [2019-12-07 11:23:49,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 268 transitions. [2019-12-07 11:23:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 11:23:49,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:49,407 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, 1, 1] [2019-12-07 11:23:49,407 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:49,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:49,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1336989440, now seen corresponding path program 1 times [2019-12-07 11:23:49,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:49,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504001676] [2019-12-07 11:23:49,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:49,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504001676] [2019-12-07 11:23:49,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:49,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:49,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335444223] [2019-12-07 11:23:49,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:49,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:49,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:49,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:49,436 INFO L87 Difference]: Start difference. First operand 177 states and 268 transitions. Second operand 4 states. [2019-12-07 11:23:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:49,637 INFO L93 Difference]: Finished difference Result 352 states and 537 transitions. [2019-12-07 11:23:49,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:49,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 11:23:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:49,639 INFO L225 Difference]: With dead ends: 352 [2019-12-07 11:23:49,639 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 11:23:49,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 11:23:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2019-12-07 11:23:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:23:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2019-12-07 11:23:49,642 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2019-12-07 11:23:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:49,642 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2019-12-07 11:23:49,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2019-12-07 11:23:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 11:23:49,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:49,643 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, 1, 1] [2019-12-07 11:23:49,643 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1849053503, now seen corresponding path program 1 times [2019-12-07 11:23:49,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:49,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042257534] [2019-12-07 11:23:49,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:23:49,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042257534] [2019-12-07 11:23:49,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:49,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:49,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025423869] [2019-12-07 11:23:49,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:49,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:49,674 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand 4 states. [2019-12-07 11:23:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:49,895 INFO L93 Difference]: Finished difference Result 342 states and 522 transitions. [2019-12-07 11:23:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:49,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 11:23:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:49,897 INFO L225 Difference]: With dead ends: 342 [2019-12-07 11:23:49,897 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 11:23:49,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 11:23:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2019-12-07 11:23:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 11:23:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 266 transitions. [2019-12-07 11:23:49,901 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 266 transitions. Word has length 78 [2019-12-07 11:23:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:49,902 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 266 transitions. [2019-12-07 11:23:49,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 266 transitions. [2019-12-07 11:23:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 11:23:49,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:49,902 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, 1] [2019-12-07 11:23:49,902 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2109463487, now seen corresponding path program 1 times [2019-12-07 11:23:49,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:49,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569760997] [2019-12-07 11:23:49,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:49,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569760997] [2019-12-07 11:23:49,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:49,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:49,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743072333] [2019-12-07 11:23:49,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:49,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:49,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:49,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:49,951 INFO L87 Difference]: Start difference. First operand 177 states and 266 transitions. Second operand 4 states. [2019-12-07 11:23:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:50,247 INFO L93 Difference]: Finished difference Result 449 states and 689 transitions. [2019-12-07 11:23:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:50,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-07 11:23:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:50,249 INFO L225 Difference]: With dead ends: 449 [2019-12-07 11:23:50,249 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 11:23:50,249 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-12-07 11:23:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 11:23:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 218. [2019-12-07 11:23:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-12-07 11:23:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 340 transitions. [2019-12-07 11:23:50,254 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 340 transitions. Word has length 83 [2019-12-07 11:23:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:50,254 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 340 transitions. [2019-12-07 11:23:50,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 340 transitions. [2019-12-07 11:23:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 11:23:50,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:50,255 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, 1] [2019-12-07 11:23:50,255 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:50,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1937357315, now seen corresponding path program 1 times [2019-12-07 11:23:50,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:50,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451485709] [2019-12-07 11:23:50,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:50,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451485709] [2019-12-07 11:23:50,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:50,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:50,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956383521] [2019-12-07 11:23:50,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:50,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:50,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:50,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:50,311 INFO L87 Difference]: Start difference. First operand 218 states and 340 transitions. Second operand 4 states. [2019-12-07 11:23:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:50,581 INFO L93 Difference]: Finished difference Result 467 states and 735 transitions. [2019-12-07 11:23:50,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:50,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-07 11:23:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:50,583 INFO L225 Difference]: With dead ends: 467 [2019-12-07 11:23:50,583 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 11:23:50,584 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-12-07 11:23:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 11:23:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 242. [2019-12-07 11:23:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 11:23:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 382 transitions. [2019-12-07 11:23:50,589 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 382 transitions. Word has length 83 [2019-12-07 11:23:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:50,589 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 382 transitions. [2019-12-07 11:23:50,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 382 transitions. [2019-12-07 11:23:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 11:23:50,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:50,591 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, 1, 1] [2019-12-07 11:23:50,591 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1110712789, now seen corresponding path program 1 times [2019-12-07 11:23:50,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:50,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968737072] [2019-12-07 11:23:50,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:50,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968737072] [2019-12-07 11:23:50,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:50,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:50,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044474500] [2019-12-07 11:23:50,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:50,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:50,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:50,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:50,651 INFO L87 Difference]: Start difference. First operand 242 states and 382 transitions. Second operand 4 states. [2019-12-07 11:23:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:50,948 INFO L93 Difference]: Finished difference Result 529 states and 833 transitions. [2019-12-07 11:23:50,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:50,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 11:23:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:50,950 INFO L225 Difference]: With dead ends: 529 [2019-12-07 11:23:50,950 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 11:23:50,950 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-12-07 11:23:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 11:23:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 243. [2019-12-07 11:23:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 11:23:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 383 transitions. [2019-12-07 11:23:50,954 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 383 transitions. Word has length 84 [2019-12-07 11:23:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:50,954 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 383 transitions. [2019-12-07 11:23:50,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 383 transitions. [2019-12-07 11:23:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 11:23:50,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:50,955 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, 1, 1] [2019-12-07 11:23:50,955 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:50,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1974058391, now seen corresponding path program 1 times [2019-12-07 11:23:50,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:50,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518381849] [2019-12-07 11:23:50,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:50,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518381849] [2019-12-07 11:23:50,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:50,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:50,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329946008] [2019-12-07 11:23:50,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:50,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:50,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:50,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:50,990 INFO L87 Difference]: Start difference. First operand 243 states and 383 transitions. Second operand 4 states. [2019-12-07 11:23:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:51,274 INFO L93 Difference]: Finished difference Result 530 states and 833 transitions. [2019-12-07 11:23:51,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:51,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 11:23:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:51,275 INFO L225 Difference]: With dead ends: 530 [2019-12-07 11:23:51,275 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 11:23:51,276 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-12-07 11:23:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 11:23:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 243. [2019-12-07 11:23:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 11:23:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 382 transitions. [2019-12-07 11:23:51,281 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 382 transitions. Word has length 96 [2019-12-07 11:23:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:51,281 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 382 transitions. [2019-12-07 11:23:51,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 382 transitions. [2019-12-07 11:23:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 11:23:51,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:51,282 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, 1, 1] [2019-12-07 11:23:51,282 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash -934123495, now seen corresponding path program 1 times [2019-12-07 11:23:51,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:51,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665698587] [2019-12-07 11:23:51,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:51,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665698587] [2019-12-07 11:23:51,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:51,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:51,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011650450] [2019-12-07 11:23:51,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:51,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:51,323 INFO L87 Difference]: Start difference. First operand 243 states and 382 transitions. Second operand 4 states. [2019-12-07 11:23:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:51,604 INFO L93 Difference]: Finished difference Result 493 states and 776 transitions. [2019-12-07 11:23:51,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:51,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 11:23:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:51,607 INFO L225 Difference]: With dead ends: 493 [2019-12-07 11:23:51,607 INFO L226 Difference]: Without dead ends: 269 [2019-12-07 11:23:51,608 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-12-07 11:23:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-07 11:23:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 243. [2019-12-07 11:23:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 11:23:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 381 transitions. [2019-12-07 11:23:51,614 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 381 transitions. Word has length 96 [2019-12-07 11:23:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:51,614 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 381 transitions. [2019-12-07 11:23:51,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 381 transitions. [2019-12-07 11:23:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:23:51,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:51,615 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, 1, 1] [2019-12-07 11:23:51,615 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:51,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash -354584751, now seen corresponding path program 1 times [2019-12-07 11:23:51,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:51,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212169824] [2019-12-07 11:23:51,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:51,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212169824] [2019-12-07 11:23:51,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:51,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:51,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616019670] [2019-12-07 11:23:51,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:51,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:51,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:51,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:51,655 INFO L87 Difference]: Start difference. First operand 243 states and 381 transitions. Second operand 4 states. [2019-12-07 11:23:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:51,988 INFO L93 Difference]: Finished difference Result 529 states and 828 transitions. [2019-12-07 11:23:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:51,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 11:23:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:51,990 INFO L225 Difference]: With dead ends: 529 [2019-12-07 11:23:51,990 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 11:23:51,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-12-07 11:23:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 11:23:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2019-12-07 11:23:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 11:23:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 380 transitions. [2019-12-07 11:23:51,994 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 380 transitions. Word has length 97 [2019-12-07 11:23:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:51,994 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 380 transitions. [2019-12-07 11:23:51,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 380 transitions. [2019-12-07 11:23:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:23:51,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:51,995 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, 1, 1] [2019-12-07 11:23:51,995 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash -311255930, now seen corresponding path program 1 times [2019-12-07 11:23:51,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:51,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159785915] [2019-12-07 11:23:51,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:52,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159785915] [2019-12-07 11:23:52,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:52,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:52,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312344341] [2019-12-07 11:23:52,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:52,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:52,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:52,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:52,048 INFO L87 Difference]: Start difference. First operand 243 states and 380 transitions. Second operand 4 states. [2019-12-07 11:23:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:52,342 INFO L93 Difference]: Finished difference Result 527 states and 824 transitions. [2019-12-07 11:23:52,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:52,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 11:23:52,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:52,343 INFO L225 Difference]: With dead ends: 527 [2019-12-07 11:23:52,343 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 11:23:52,344 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-12-07 11:23:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 11:23:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 243. [2019-12-07 11:23:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 11:23:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 379 transitions. [2019-12-07 11:23:52,347 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 379 transitions. Word has length 97 [2019-12-07 11:23:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:52,347 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 379 transitions. [2019-12-07 11:23:52,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 379 transitions. [2019-12-07 11:23:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:23:52,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:52,348 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, 1, 1] [2019-12-07 11:23:52,348 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1659030854, now seen corresponding path program 1 times [2019-12-07 11:23:52,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:52,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824409263] [2019-12-07 11:23:52,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:52,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824409263] [2019-12-07 11:23:52,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:52,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:52,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713761700] [2019-12-07 11:23:52,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:52,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:52,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:52,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:52,381 INFO L87 Difference]: Start difference. First operand 243 states and 379 transitions. Second operand 4 states. [2019-12-07 11:23:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:52,654 INFO L93 Difference]: Finished difference Result 526 states and 821 transitions. [2019-12-07 11:23:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:52,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 11:23:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:52,656 INFO L225 Difference]: With dead ends: 526 [2019-12-07 11:23:52,656 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 11:23:52,657 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-12-07 11:23:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 11:23:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 243. [2019-12-07 11:23:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 11:23:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 378 transitions. [2019-12-07 11:23:52,660 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 378 transitions. Word has length 97 [2019-12-07 11:23:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:52,660 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 378 transitions. [2019-12-07 11:23:52,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 378 transitions. [2019-12-07 11:23:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:23:52,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:52,661 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, 1] [2019-12-07 11:23:52,661 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1990120131, now seen corresponding path program 1 times [2019-12-07 11:23:52,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:52,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277877152] [2019-12-07 11:23:52,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 11:23:52,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277877152] [2019-12-07 11:23:52,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:52,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:23:52,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125740725] [2019-12-07 11:23:52,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:23:52,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:52,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:23:52,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:52,707 INFO L87 Difference]: Start difference. First operand 243 states and 378 transitions. Second operand 5 states. [2019-12-07 11:23:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:53,019 INFO L93 Difference]: Finished difference Result 488 states and 764 transitions. [2019-12-07 11:23:53,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:23:53,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-07 11:23:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:53,021 INFO L225 Difference]: With dead ends: 488 [2019-12-07 11:23:53,021 INFO L226 Difference]: Without dead ends: 264 [2019-12-07 11:23:53,021 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-12-07 11:23:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-07 11:23:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-12-07 11:23:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 404 transitions. [2019-12-07 11:23:53,025 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 404 transitions. Word has length 97 [2019-12-07 11:23:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:53,025 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 404 transitions. [2019-12-07 11:23:53,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:23:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 404 transitions. [2019-12-07 11:23:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:23:53,026 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:53,026 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, 1, 1] [2019-12-07 11:23:53,026 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash -270581180, now seen corresponding path program 1 times [2019-12-07 11:23:53,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:53,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554306657] [2019-12-07 11:23:53,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:53,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554306657] [2019-12-07 11:23:53,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:53,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:53,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068595321] [2019-12-07 11:23:53,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:53,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:53,059 INFO L87 Difference]: Start difference. First operand 263 states and 404 transitions. Second operand 4 states. [2019-12-07 11:23:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:53,291 INFO L93 Difference]: Finished difference Result 530 states and 816 transitions. [2019-12-07 11:23:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:53,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 11:23:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:53,292 INFO L225 Difference]: With dead ends: 530 [2019-12-07 11:23:53,292 INFO L226 Difference]: Without dead ends: 286 [2019-12-07 11:23:53,293 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-12-07 11:23:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-12-07 11:23:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2019-12-07 11:23:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 403 transitions. [2019-12-07 11:23:53,297 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 403 transitions. Word has length 97 [2019-12-07 11:23:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:53,297 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 403 transitions. [2019-12-07 11:23:53,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 403 transitions. [2019-12-07 11:23:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:23:53,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:53,298 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, 1, 1] [2019-12-07 11:23:53,298 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:53,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:53,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1699705604, now seen corresponding path program 1 times [2019-12-07 11:23:53,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:53,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443457781] [2019-12-07 11:23:53,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:53,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443457781] [2019-12-07 11:23:53,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:53,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:53,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803345148] [2019-12-07 11:23:53,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:53,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:53,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:53,331 INFO L87 Difference]: Start difference. First operand 263 states and 403 transitions. Second operand 4 states. [2019-12-07 11:23:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:53,554 INFO L93 Difference]: Finished difference Result 529 states and 813 transitions. [2019-12-07 11:23:53,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:53,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 11:23:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:53,555 INFO L225 Difference]: With dead ends: 529 [2019-12-07 11:23:53,555 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 11:23:53,556 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-12-07 11:23:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 11:23:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-12-07 11:23:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 402 transitions. [2019-12-07 11:23:53,560 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 402 transitions. Word has length 97 [2019-12-07 11:23:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:53,560 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 402 transitions. [2019-12-07 11:23:53,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 402 transitions. [2019-12-07 11:23:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:23:53,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:53,561 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, 1, 1] [2019-12-07 11:23:53,562 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:53,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:53,562 INFO L82 PathProgramCache]: Analyzing trace with hash 337163803, now seen corresponding path program 1 times [2019-12-07 11:23:53,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:53,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256897112] [2019-12-07 11:23:53,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:53,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256897112] [2019-12-07 11:23:53,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:53,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:53,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923040791] [2019-12-07 11:23:53,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:53,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:53,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:53,605 INFO L87 Difference]: Start difference. First operand 263 states and 402 transitions. Second operand 4 states. [2019-12-07 11:23:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:53,900 INFO L93 Difference]: Finished difference Result 566 states and 866 transitions. [2019-12-07 11:23:53,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:53,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 11:23:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:53,902 INFO L225 Difference]: With dead ends: 566 [2019-12-07 11:23:53,902 INFO L226 Difference]: Without dead ends: 322 [2019-12-07 11:23:53,903 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-12-07 11:23:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-07 11:23:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 263. [2019-12-07 11:23:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2019-12-07 11:23:53,908 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 98 [2019-12-07 11:23:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:53,908 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2019-12-07 11:23:53,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2019-12-07 11:23:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:23:53,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:53,909 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, 1, 1] [2019-12-07 11:23:53,909 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:53,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:53,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1598081053, now seen corresponding path program 1 times [2019-12-07 11:23:53,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:53,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761751324] [2019-12-07 11:23:53,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:53,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761751324] [2019-12-07 11:23:53,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:53,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:53,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117084591] [2019-12-07 11:23:53,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:53,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:53,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:53,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:53,953 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand 4 states. [2019-12-07 11:23:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:54,174 INFO L93 Difference]: Finished difference Result 529 states and 809 transitions. [2019-12-07 11:23:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:54,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 11:23:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:54,175 INFO L225 Difference]: With dead ends: 529 [2019-12-07 11:23:54,175 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 11:23:54,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-12-07 11:23:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 11:23:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-12-07 11:23:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 400 transitions. [2019-12-07 11:23:54,179 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 400 transitions. Word has length 98 [2019-12-07 11:23:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:54,180 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 400 transitions. [2019-12-07 11:23:54,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 400 transitions. [2019-12-07 11:23:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:23:54,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:54,180 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, 1, 1] [2019-12-07 11:23:54,180 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1403773942, now seen corresponding path program 1 times [2019-12-07 11:23:54,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:54,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862168632] [2019-12-07 11:23:54,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:54,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862168632] [2019-12-07 11:23:54,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:54,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:54,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816968089] [2019-12-07 11:23:54,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:54,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:54,214 INFO L87 Difference]: Start difference. First operand 263 states and 400 transitions. Second operand 4 states. [2019-12-07 11:23:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:54,491 INFO L93 Difference]: Finished difference Result 566 states and 862 transitions. [2019-12-07 11:23:54,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:54,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 11:23:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:54,493 INFO L225 Difference]: With dead ends: 566 [2019-12-07 11:23:54,493 INFO L226 Difference]: Without dead ends: 322 [2019-12-07 11:23:54,493 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-12-07 11:23:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-07 11:23:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 263. [2019-12-07 11:23:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 399 transitions. [2019-12-07 11:23:54,498 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 399 transitions. Word has length 99 [2019-12-07 11:23:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:54,498 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 399 transitions. [2019-12-07 11:23:54,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 399 transitions. [2019-12-07 11:23:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:23:54,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:54,499 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, 1, 1] [2019-12-07 11:23:54,499 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -970044856, now seen corresponding path program 1 times [2019-12-07 11:23:54,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:54,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773188250] [2019-12-07 11:23:54,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:54,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773188250] [2019-12-07 11:23:54,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:54,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:54,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112524500] [2019-12-07 11:23:54,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:54,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:54,534 INFO L87 Difference]: Start difference. First operand 263 states and 399 transitions. Second operand 4 states. [2019-12-07 11:23:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:54,747 INFO L93 Difference]: Finished difference Result 529 states and 805 transitions. [2019-12-07 11:23:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:54,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 11:23:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:54,749 INFO L225 Difference]: With dead ends: 529 [2019-12-07 11:23:54,749 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 11:23:54,750 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-12-07 11:23:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 11:23:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-12-07 11:23:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2019-12-07 11:23:54,756 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 99 [2019-12-07 11:23:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:54,756 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2019-12-07 11:23:54,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2019-12-07 11:23:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:23:54,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:54,757 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, 1, 1] [2019-12-07 11:23:54,758 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash 422934016, now seen corresponding path program 1 times [2019-12-07 11:23:54,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:54,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912393086] [2019-12-07 11:23:54,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:54,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912393086] [2019-12-07 11:23:54,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:54,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:54,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331199538] [2019-12-07 11:23:54,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:54,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:54,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:54,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:54,799 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand 4 states. [2019-12-07 11:23:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:55,095 INFO L93 Difference]: Finished difference Result 566 states and 858 transitions. [2019-12-07 11:23:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:55,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 11:23:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:55,097 INFO L225 Difference]: With dead ends: 566 [2019-12-07 11:23:55,097 INFO L226 Difference]: Without dead ends: 322 [2019-12-07 11:23:55,097 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-12-07 11:23:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-07 11:23:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 263. [2019-12-07 11:23:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2019-12-07 11:23:55,101 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 100 [2019-12-07 11:23:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:55,102 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2019-12-07 11:23:55,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2019-12-07 11:23:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:23:55,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:55,103 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, 1, 1] [2019-12-07 11:23:55,103 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 983633794, now seen corresponding path program 1 times [2019-12-07 11:23:55,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:55,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890324907] [2019-12-07 11:23:55,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:55,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890324907] [2019-12-07 11:23:55,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:55,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:55,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224345697] [2019-12-07 11:23:55,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:55,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:55,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:55,141 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand 4 states. [2019-12-07 11:23:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:55,355 INFO L93 Difference]: Finished difference Result 529 states and 801 transitions. [2019-12-07 11:23:55,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:55,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 11:23:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:55,356 INFO L225 Difference]: With dead ends: 529 [2019-12-07 11:23:55,356 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 11:23:55,357 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-12-07 11:23:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 11:23:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-12-07 11:23:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2019-12-07 11:23:55,361 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 100 [2019-12-07 11:23:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:55,361 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2019-12-07 11:23:55,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2019-12-07 11:23:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 11:23:55,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:55,362 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, 1, 1] [2019-12-07 11:23:55,362 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:55,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:55,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1177509071, now seen corresponding path program 1 times [2019-12-07 11:23:55,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:55,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6141180] [2019-12-07 11:23:55,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:55,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6141180] [2019-12-07 11:23:55,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:55,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:55,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651228765] [2019-12-07 11:23:55,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:55,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:55,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:55,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:55,398 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand 4 states. [2019-12-07 11:23:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:55,664 INFO L93 Difference]: Finished difference Result 556 states and 842 transitions. [2019-12-07 11:23:55,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:55,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 11:23:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:55,665 INFO L225 Difference]: With dead ends: 556 [2019-12-07 11:23:55,665 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 11:23:55,666 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-12-07 11:23:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 11:23:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 263. [2019-12-07 11:23:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2019-12-07 11:23:55,670 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 101 [2019-12-07 11:23:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:55,671 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2019-12-07 11:23:55,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2019-12-07 11:23:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 11:23:55,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:55,671 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, 1, 1] [2019-12-07 11:23:55,672 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:55,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1379333005, now seen corresponding path program 1 times [2019-12-07 11:23:55,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:55,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787040774] [2019-12-07 11:23:55,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:55,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787040774] [2019-12-07 11:23:55,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:55,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:55,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404212838] [2019-12-07 11:23:55,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:55,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:55,709 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand 4 states. [2019-12-07 11:23:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:55,924 INFO L93 Difference]: Finished difference Result 519 states and 785 transitions. [2019-12-07 11:23:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:55,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 11:23:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:55,925 INFO L225 Difference]: With dead ends: 519 [2019-12-07 11:23:55,925 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 11:23:55,926 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-12-07 11:23:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 11:23:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 263. [2019-12-07 11:23:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2019-12-07 11:23:55,931 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 101 [2019-12-07 11:23:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:55,931 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2019-12-07 11:23:55,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2019-12-07 11:23:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 11:23:55,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:55,932 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-12-07 11:23:55,932 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash -933489527, now seen corresponding path program 1 times [2019-12-07 11:23:55,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:55,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114872474] [2019-12-07 11:23:55,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:23:55,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114872474] [2019-12-07 11:23:55,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:55,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:55,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781221523] [2019-12-07 11:23:55,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:55,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:55,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:55,981 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand 4 states. [2019-12-07 11:23:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:56,247 INFO L93 Difference]: Finished difference Result 556 states and 838 transitions. [2019-12-07 11:23:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:56,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-12-07 11:23:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:56,248 INFO L225 Difference]: With dead ends: 556 [2019-12-07 11:23:56,249 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 11:23:56,249 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-12-07 11:23:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 11:23:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 263. [2019-12-07 11:23:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-12-07 11:23:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2019-12-07 11:23:56,254 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 105 [2019-12-07 11:23:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:56,254 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2019-12-07 11:23:56,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2019-12-07 11:23:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 11:23:56,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:56,255 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-12-07 11:23:56,255 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:56,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:56,255 INFO L82 PathProgramCache]: Analyzing trace with hash -987882425, now seen corresponding path program 1 times [2019-12-07 11:23:56,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:56,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568059486] [2019-12-07 11:23:56,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 11:23:56,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568059486] [2019-12-07 11:23:56,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:56,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:23:56,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776233168] [2019-12-07 11:23:56,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:23:56,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:23:56,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:23:56,290 INFO L87 Difference]: Start difference. First operand 263 states and 393 transitions. Second operand 3 states. [2019-12-07 11:23:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:56,343 INFO L93 Difference]: Finished difference Result 749 states and 1134 transitions. [2019-12-07 11:23:56,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:23:56,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 11:23:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:56,345 INFO L225 Difference]: With dead ends: 749 [2019-12-07 11:23:56,345 INFO L226 Difference]: Without dead ends: 505 [2019-12-07 11:23:56,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:23:56,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-12-07 11:23:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-12-07 11:23:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-12-07 11:23:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 747 transitions. [2019-12-07 11:23:56,353 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 747 transitions. Word has length 105 [2019-12-07 11:23:56,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:56,353 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 747 transitions. [2019-12-07 11:23:56,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:23:56,353 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 747 transitions. [2019-12-07 11:23:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 11:23:56,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:56,354 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, 1, 1] [2019-12-07 11:23:56,354 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:56,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:56,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1325689411, now seen corresponding path program 1 times [2019-12-07 11:23:56,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:56,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654064683] [2019-12-07 11:23:56,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:23:56,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654064683] [2019-12-07 11:23:56,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:56,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:23:56,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608951279] [2019-12-07 11:23:56,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:23:56,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:23:56,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:23:56,386 INFO L87 Difference]: Start difference. First operand 505 states and 747 transitions. Second operand 3 states. [2019-12-07 11:23:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:56,440 INFO L93 Difference]: Finished difference Result 1233 states and 1842 transitions. [2019-12-07 11:23:56,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:23:56,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-12-07 11:23:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:56,443 INFO L225 Difference]: With dead ends: 1233 [2019-12-07 11:23:56,443 INFO L226 Difference]: Without dead ends: 747 [2019-12-07 11:23:56,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:23:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-12-07 11:23:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-12-07 11:23:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-12-07 11:23:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1102 transitions. [2019-12-07 11:23:56,454 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1102 transitions. Word has length 107 [2019-12-07 11:23:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:56,455 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1102 transitions. [2019-12-07 11:23:56,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:23:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1102 transitions. [2019-12-07 11:23:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 11:23:56,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:56,456 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, 1, 1] [2019-12-07 11:23:56,456 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash -982069472, now seen corresponding path program 1 times [2019-12-07 11:23:56,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:56,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046587161] [2019-12-07 11:23:56,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:56,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046587161] [2019-12-07 11:23:56,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:56,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:56,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587028393] [2019-12-07 11:23:56,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:56,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:56,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:56,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:56,504 INFO L87 Difference]: Start difference. First operand 747 states and 1102 transitions. Second operand 4 states. [2019-12-07 11:23:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:56,781 INFO L93 Difference]: Finished difference Result 1664 states and 2476 transitions. [2019-12-07 11:23:56,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:56,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-12-07 11:23:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:56,785 INFO L225 Difference]: With dead ends: 1664 [2019-12-07 11:23:56,785 INFO L226 Difference]: Without dead ends: 936 [2019-12-07 11:23:56,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-07 11:23:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 831. [2019-12-07 11:23:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1249 transitions. [2019-12-07 11:23:56,798 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1249 transitions. Word has length 136 [2019-12-07 11:23:56,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:56,798 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1249 transitions. [2019-12-07 11:23:56,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1249 transitions. [2019-12-07 11:23:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 11:23:56,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:56,799 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, 1, 1] [2019-12-07 11:23:56,799 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash 664473558, now seen corresponding path program 1 times [2019-12-07 11:23:56,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:56,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477672936] [2019-12-07 11:23:56,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:56,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477672936] [2019-12-07 11:23:56,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:56,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:56,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116765089] [2019-12-07 11:23:56,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:56,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:56,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:56,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:56,843 INFO L87 Difference]: Start difference. First operand 831 states and 1249 transitions. Second operand 4 states. [2019-12-07 11:23:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:57,113 INFO L93 Difference]: Finished difference Result 1748 states and 2620 transitions. [2019-12-07 11:23:57,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:57,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 11:23:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:57,117 INFO L225 Difference]: With dead ends: 1748 [2019-12-07 11:23:57,117 INFO L226 Difference]: Without dead ends: 936 [2019-12-07 11:23:57,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-07 11:23:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 831. [2019-12-07 11:23:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1246 transitions. [2019-12-07 11:23:57,130 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1246 transitions. Word has length 149 [2019-12-07 11:23:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:57,131 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1246 transitions. [2019-12-07 11:23:57,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1246 transitions. [2019-12-07 11:23:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 11:23:57,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:57,132 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, 1, 1] [2019-12-07 11:23:57,132 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2041287207, now seen corresponding path program 1 times [2019-12-07 11:23:57,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:57,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567136904] [2019-12-07 11:23:57,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:57,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567136904] [2019-12-07 11:23:57,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:57,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:57,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520560472] [2019-12-07 11:23:57,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:57,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:57,184 INFO L87 Difference]: Start difference. First operand 831 states and 1246 transitions. Second operand 4 states. [2019-12-07 11:23:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:57,450 INFO L93 Difference]: Finished difference Result 1742 states and 2608 transitions. [2019-12-07 11:23:57,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:57,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 11:23:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:57,454 INFO L225 Difference]: With dead ends: 1742 [2019-12-07 11:23:57,454 INFO L226 Difference]: Without dead ends: 930 [2019-12-07 11:23:57,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-12-07 11:23:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 831. [2019-12-07 11:23:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1243 transitions. [2019-12-07 11:23:57,478 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1243 transitions. Word has length 150 [2019-12-07 11:23:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:57,478 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1243 transitions. [2019-12-07 11:23:57,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1243 transitions. [2019-12-07 11:23:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 11:23:57,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:57,480 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, 1, 1] [2019-12-07 11:23:57,480 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:57,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:57,481 INFO L82 PathProgramCache]: Analyzing trace with hash -283393305, now seen corresponding path program 1 times [2019-12-07 11:23:57,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:57,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905834777] [2019-12-07 11:23:57,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:57,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905834777] [2019-12-07 11:23:57,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:57,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:57,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596206853] [2019-12-07 11:23:57,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:57,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:57,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:57,525 INFO L87 Difference]: Start difference. First operand 831 states and 1243 transitions. Second operand 4 states. [2019-12-07 11:23:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:57,788 INFO L93 Difference]: Finished difference Result 1739 states and 2599 transitions. [2019-12-07 11:23:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:57,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 11:23:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:57,791 INFO L225 Difference]: With dead ends: 1739 [2019-12-07 11:23:57,792 INFO L226 Difference]: Without dead ends: 927 [2019-12-07 11:23:57,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-07 11:23:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-12-07 11:23:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1240 transitions. [2019-12-07 11:23:57,804 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1240 transitions. Word has length 150 [2019-12-07 11:23:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:57,804 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1240 transitions. [2019-12-07 11:23:57,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1240 transitions. [2019-12-07 11:23:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 11:23:57,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:57,806 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, 1, 1] [2019-12-07 11:23:57,806 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash 251557018, now seen corresponding path program 1 times [2019-12-07 11:23:57,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:57,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841876957] [2019-12-07 11:23:57,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:57,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841876957] [2019-12-07 11:23:57,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:57,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:57,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886243501] [2019-12-07 11:23:57,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:57,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:57,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:57,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:57,849 INFO L87 Difference]: Start difference. First operand 831 states and 1240 transitions. Second operand 4 states. [2019-12-07 11:23:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:58,114 INFO L93 Difference]: Finished difference Result 1739 states and 2593 transitions. [2019-12-07 11:23:58,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:58,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 11:23:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:58,118 INFO L225 Difference]: With dead ends: 1739 [2019-12-07 11:23:58,118 INFO L226 Difference]: Without dead ends: 927 [2019-12-07 11:23:58,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-07 11:23:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-12-07 11:23:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1237 transitions. [2019-12-07 11:23:58,130 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1237 transitions. Word has length 151 [2019-12-07 11:23:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:58,130 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1237 transitions. [2019-12-07 11:23:58,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1237 transitions. [2019-12-07 11:23:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 11:23:58,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:58,131 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, 1, 1] [2019-12-07 11:23:58,131 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 237383019, now seen corresponding path program 1 times [2019-12-07 11:23:58,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:58,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754681186] [2019-12-07 11:23:58,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:58,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754681186] [2019-12-07 11:23:58,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:58,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:58,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703418754] [2019-12-07 11:23:58,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:58,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:58,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:58,182 INFO L87 Difference]: Start difference. First operand 831 states and 1237 transitions. Second operand 4 states. [2019-12-07 11:23:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:58,455 INFO L93 Difference]: Finished difference Result 1739 states and 2587 transitions. [2019-12-07 11:23:58,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:58,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 11:23:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:58,459 INFO L225 Difference]: With dead ends: 1739 [2019-12-07 11:23:58,459 INFO L226 Difference]: Without dead ends: 927 [2019-12-07 11:23:58,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-07 11:23:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-12-07 11:23:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1234 transitions. [2019-12-07 11:23:58,472 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1234 transitions. Word has length 152 [2019-12-07 11:23:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:58,472 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1234 transitions. [2019-12-07 11:23:58,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1234 transitions. [2019-12-07 11:23:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 11:23:58,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:58,473 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, 1, 1] [2019-12-07 11:23:58,473 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash -240807745, now seen corresponding path program 1 times [2019-12-07 11:23:58,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:58,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668125602] [2019-12-07 11:23:58,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:58,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668125602] [2019-12-07 11:23:58,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:58,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:58,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471716083] [2019-12-07 11:23:58,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:58,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:58,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:58,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:58,517 INFO L87 Difference]: Start difference. First operand 831 states and 1234 transitions. Second operand 4 states. [2019-12-07 11:23:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:58,824 INFO L93 Difference]: Finished difference Result 1739 states and 2581 transitions. [2019-12-07 11:23:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:58,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 11:23:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:58,830 INFO L225 Difference]: With dead ends: 1739 [2019-12-07 11:23:58,830 INFO L226 Difference]: Without dead ends: 927 [2019-12-07 11:23:58,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-07 11:23:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-12-07 11:23:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1231 transitions. [2019-12-07 11:23:58,848 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1231 transitions. Word has length 153 [2019-12-07 11:23:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:58,848 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1231 transitions. [2019-12-07 11:23:58,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1231 transitions. [2019-12-07 11:23:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 11:23:58,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:58,850 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, 1, 1] [2019-12-07 11:23:58,850 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2076350960, now seen corresponding path program 1 times [2019-12-07 11:23:58,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:58,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044976876] [2019-12-07 11:23:58,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:58,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044976876] [2019-12-07 11:23:58,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:58,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:58,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616744057] [2019-12-07 11:23:58,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:58,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:58,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:58,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:58,896 INFO L87 Difference]: Start difference. First operand 831 states and 1231 transitions. Second operand 4 states. [2019-12-07 11:23:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:59,208 INFO L93 Difference]: Finished difference Result 1709 states and 2539 transitions. [2019-12-07 11:23:59,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:59,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 11:23:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:59,213 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 11:23:59,213 INFO L226 Difference]: Without dead ends: 897 [2019-12-07 11:23:59,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-12-07 11:23:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 831. [2019-12-07 11:23:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1228 transitions. [2019-12-07 11:23:59,227 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1228 transitions. Word has length 154 [2019-12-07 11:23:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:59,228 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1228 transitions. [2019-12-07 11:23:59,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1228 transitions. [2019-12-07 11:23:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 11:23:59,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:59,229 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, 1, 1] [2019-12-07 11:23:59,229 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:59,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1507449130, now seen corresponding path program 1 times [2019-12-07 11:23:59,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:59,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217958141] [2019-12-07 11:23:59,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:59,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217958141] [2019-12-07 11:23:59,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:59,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:59,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221769342] [2019-12-07 11:23:59,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:59,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:59,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:59,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:59,298 INFO L87 Difference]: Start difference. First operand 831 states and 1228 transitions. Second operand 4 states. [2019-12-07 11:23:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:59,540 INFO L93 Difference]: Finished difference Result 1709 states and 2533 transitions. [2019-12-07 11:23:59,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:59,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 11:23:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:59,544 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 11:23:59,544 INFO L226 Difference]: Without dead ends: 897 [2019-12-07 11:23:59,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-12-07 11:23:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 831. [2019-12-07 11:23:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1225 transitions. [2019-12-07 11:23:59,556 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1225 transitions. Word has length 158 [2019-12-07 11:23:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:59,556 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1225 transitions. [2019-12-07 11:23:59,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1225 transitions. [2019-12-07 11:23:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 11:23:59,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:59,558 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, 1, 1] [2019-12-07 11:23:59,558 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:59,558 INFO L82 PathProgramCache]: Analyzing trace with hash -677396615, now seen corresponding path program 1 times [2019-12-07 11:23:59,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:59,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624782119] [2019-12-07 11:23:59,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:23:59,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624782119] [2019-12-07 11:23:59,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:59,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:59,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644142771] [2019-12-07 11:23:59,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:59,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:59,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:59,609 INFO L87 Difference]: Start difference. First operand 831 states and 1225 transitions. Second operand 4 states. [2019-12-07 11:23:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:59,843 INFO L93 Difference]: Finished difference Result 1694 states and 2506 transitions. [2019-12-07 11:23:59,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:59,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 11:23:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:59,846 INFO L225 Difference]: With dead ends: 1694 [2019-12-07 11:23:59,846 INFO L226 Difference]: Without dead ends: 882 [2019-12-07 11:23:59,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-12-07 11:23:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 831. [2019-12-07 11:23:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 11:23:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1222 transitions. [2019-12-07 11:23:59,859 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1222 transitions. Word has length 159 [2019-12-07 11:23:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:59,859 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1222 transitions. [2019-12-07 11:23:59,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1222 transitions. [2019-12-07 11:23:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 11:23:59,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:59,860 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] [2019-12-07 11:23:59,860 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:59,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1354743335, now seen corresponding path program 1 times [2019-12-07 11:23:59,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:59,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407439761] [2019-12-07 11:23:59,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:23:59,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407439761] [2019-12-07 11:23:59,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:59,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:59,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952763097] [2019-12-07 11:23:59,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:59,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:59,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:59,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:59,911 INFO L87 Difference]: Start difference. First operand 831 states and 1222 transitions. Second operand 4 states. [2019-12-07 11:24:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:00,225 INFO L93 Difference]: Finished difference Result 1844 states and 2734 transitions. [2019-12-07 11:24:00,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:00,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 11:24:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:00,229 INFO L225 Difference]: With dead ends: 1844 [2019-12-07 11:24:00,229 INFO L226 Difference]: Without dead ends: 1032 [2019-12-07 11:24:00,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2019-12-07 11:24:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 921. [2019-12-07 11:24:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-12-07 11:24:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1381 transitions. [2019-12-07 11:24:00,244 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1381 transitions. Word has length 161 [2019-12-07 11:24:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:00,244 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1381 transitions. [2019-12-07 11:24:00,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1381 transitions. [2019-12-07 11:24:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 11:24:00,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:00,246 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, 1, 1] [2019-12-07 11:24:00,246 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:00,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:00,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1739058850, now seen corresponding path program 1 times [2019-12-07 11:24:00,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:00,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301203059] [2019-12-07 11:24:00,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:24:00,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301203059] [2019-12-07 11:24:00,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:00,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:00,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967313173] [2019-12-07 11:24:00,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:00,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:00,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:00,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:00,301 INFO L87 Difference]: Start difference. First operand 921 states and 1381 transitions. Second operand 3 states. [2019-12-07 11:24:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:00,356 INFO L93 Difference]: Finished difference Result 2123 states and 3203 transitions. [2019-12-07 11:24:00,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:00,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 11:24:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:00,361 INFO L225 Difference]: With dead ends: 2123 [2019-12-07 11:24:00,361 INFO L226 Difference]: Without dead ends: 1221 [2019-12-07 11:24:00,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-12-07 11:24:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1221. [2019-12-07 11:24:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-12-07 11:24:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1831 transitions. [2019-12-07 11:24:00,378 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1831 transitions. Word has length 167 [2019-12-07 11:24:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:00,379 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 1831 transitions. [2019-12-07 11:24:00,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1831 transitions. [2019-12-07 11:24:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 11:24:00,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:00,380 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, 1, 1] [2019-12-07 11:24:00,380 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:00,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1096356646, now seen corresponding path program 1 times [2019-12-07 11:24:00,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:00,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478153270] [2019-12-07 11:24:00,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 11:24:00,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478153270] [2019-12-07 11:24:00,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:00,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:00,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110874462] [2019-12-07 11:24:00,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:00,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:00,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:00,431 INFO L87 Difference]: Start difference. First operand 1221 states and 1831 transitions. Second operand 4 states. [2019-12-07 11:24:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:00,675 INFO L93 Difference]: Finished difference Result 2491 states and 3744 transitions. [2019-12-07 11:24:00,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:00,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-12-07 11:24:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:00,679 INFO L225 Difference]: With dead ends: 2491 [2019-12-07 11:24:00,680 INFO L226 Difference]: Without dead ends: 1289 [2019-12-07 11:24:00,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-12-07 11:24:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1221. [2019-12-07 11:24:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-12-07 11:24:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1827 transitions. [2019-12-07 11:24:00,706 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1827 transitions. Word has length 190 [2019-12-07 11:24:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:00,707 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 1827 transitions. [2019-12-07 11:24:00,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1827 transitions. [2019-12-07 11:24:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 11:24:00,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:00,708 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, 1, 1] [2019-12-07 11:24:00,708 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:00,708 INFO L82 PathProgramCache]: Analyzing trace with hash -987913707, now seen corresponding path program 1 times [2019-12-07 11:24:00,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:00,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812920138] [2019-12-07 11:24:00,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 11:24:00,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812920138] [2019-12-07 11:24:00,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:00,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:00,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227760093] [2019-12-07 11:24:00,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:00,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:00,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:00,761 INFO L87 Difference]: Start difference. First operand 1221 states and 1827 transitions. Second operand 4 states. [2019-12-07 11:24:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:00,994 INFO L93 Difference]: Finished difference Result 2475 states and 3712 transitions. [2019-12-07 11:24:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:00,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-12-07 11:24:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:00,999 INFO L225 Difference]: With dead ends: 2475 [2019-12-07 11:24:00,999 INFO L226 Difference]: Without dead ends: 1273 [2019-12-07 11:24:01,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-12-07 11:24:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1221. [2019-12-07 11:24:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-12-07 11:24:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1823 transitions. [2019-12-07 11:24:01,017 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1823 transitions. Word has length 191 [2019-12-07 11:24:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:01,017 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 1823 transitions. [2019-12-07 11:24:01,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1823 transitions. [2019-12-07 11:24:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-07 11:24:01,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:01,019 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-12-07 11:24:01,019 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash -260688466, now seen corresponding path program 1 times [2019-12-07 11:24:01,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:01,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582091403] [2019-12-07 11:24:01,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 11:24:01,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582091403] [2019-12-07 11:24:01,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:01,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:01,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991324002] [2019-12-07 11:24:01,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:01,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:01,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:01,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,078 INFO L87 Difference]: Start difference. First operand 1221 states and 1823 transitions. Second operand 3 states. [2019-12-07 11:24:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:01,136 INFO L93 Difference]: Finished difference Result 2723 states and 4085 transitions. [2019-12-07 11:24:01,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:01,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-12-07 11:24:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:01,138 INFO L225 Difference]: With dead ends: 2723 [2019-12-07 11:24:01,139 INFO L226 Difference]: Without dead ends: 1521 [2019-12-07 11:24:01,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-12-07 11:24:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2019-12-07 11:24:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2019-12-07 11:24:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2272 transitions. [2019-12-07 11:24:01,161 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2272 transitions. Word has length 199 [2019-12-07 11:24:01,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:01,161 INFO L462 AbstractCegarLoop]: Abstraction has 1521 states and 2272 transitions. [2019-12-07 11:24:01,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2272 transitions. [2019-12-07 11:24:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-07 11:24:01,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:01,163 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, 1, 1] [2019-12-07 11:24:01,163 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:01,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:01,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1496144776, now seen corresponding path program 1 times [2019-12-07 11:24:01,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:01,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305444351] [2019-12-07 11:24:01,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 11:24:01,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305444351] [2019-12-07 11:24:01,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:01,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:01,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865257935] [2019-12-07 11:24:01,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:01,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:01,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:01,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,217 INFO L87 Difference]: Start difference. First operand 1521 states and 2272 transitions. Second operand 3 states. [2019-12-07 11:24:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:01,282 INFO L93 Difference]: Finished difference Result 3323 states and 4983 transitions. [2019-12-07 11:24:01,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:01,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-12-07 11:24:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:01,284 INFO L225 Difference]: With dead ends: 3323 [2019-12-07 11:24:01,284 INFO L226 Difference]: Without dead ends: 1821 [2019-12-07 11:24:01,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2019-12-07 11:24:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2019-12-07 11:24:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-12-07 11:24:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2722 transitions. [2019-12-07 11:24:01,311 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2722 transitions. Word has length 201 [2019-12-07 11:24:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:01,312 INFO L462 AbstractCegarLoop]: Abstraction has 1821 states and 2722 transitions. [2019-12-07 11:24:01,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2722 transitions. [2019-12-07 11:24:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-12-07 11:24:01,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:01,314 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, 1, 1] [2019-12-07 11:24:01,314 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:01,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1414654094, now seen corresponding path program 1 times [2019-12-07 11:24:01,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:01,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871021733] [2019-12-07 11:24:01,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-12-07 11:24:01,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871021733] [2019-12-07 11:24:01,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:01,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:01,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734449906] [2019-12-07 11:24:01,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:01,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:01,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,378 INFO L87 Difference]: Start difference. First operand 1821 states and 2722 transitions. Second operand 3 states. [2019-12-07 11:24:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:01,442 INFO L93 Difference]: Finished difference Result 3923 states and 5883 transitions. [2019-12-07 11:24:01,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:01,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-12-07 11:24:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:01,444 INFO L225 Difference]: With dead ends: 3923 [2019-12-07 11:24:01,444 INFO L226 Difference]: Without dead ends: 2121 [2019-12-07 11:24:01,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-12-07 11:24:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2121. [2019-12-07 11:24:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2019-12-07 11:24:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3173 transitions. [2019-12-07 11:24:01,474 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3173 transitions. Word has length 234 [2019-12-07 11:24:01,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:01,474 INFO L462 AbstractCegarLoop]: Abstraction has 2121 states and 3173 transitions. [2019-12-07 11:24:01,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3173 transitions. [2019-12-07 11:24:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-12-07 11:24:01,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:01,477 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, 1, 1] [2019-12-07 11:24:01,477 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash -931085824, now seen corresponding path program 1 times [2019-12-07 11:24:01,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:01,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235732376] [2019-12-07 11:24:01,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-12-07 11:24:01,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235732376] [2019-12-07 11:24:01,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:01,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:01,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042975930] [2019-12-07 11:24:01,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:01,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:01,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:01,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,578 INFO L87 Difference]: Start difference. First operand 2121 states and 3173 transitions. Second operand 3 states. [2019-12-07 11:24:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:01,663 INFO L93 Difference]: Finished difference Result 4516 states and 6774 transitions. [2019-12-07 11:24:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:01,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-12-07 11:24:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:01,666 INFO L225 Difference]: With dead ends: 4516 [2019-12-07 11:24:01,666 INFO L226 Difference]: Without dead ends: 2414 [2019-12-07 11:24:01,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-12-07 11:24:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2414. [2019-12-07 11:24:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2414 states. [2019-12-07 11:24:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3607 transitions. [2019-12-07 11:24:01,698 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3607 transitions. Word has length 269 [2019-12-07 11:24:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:01,698 INFO L462 AbstractCegarLoop]: Abstraction has 2414 states and 3607 transitions. [2019-12-07 11:24:01,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3607 transitions. [2019-12-07 11:24:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-12-07 11:24:01,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:01,701 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, 1, 1] [2019-12-07 11:24:01,701 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash -378887603, now seen corresponding path program 1 times [2019-12-07 11:24:01,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:01,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992837400] [2019-12-07 11:24:01,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-12-07 11:24:01,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992837400] [2019-12-07 11:24:01,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:01,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:01,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757450102] [2019-12-07 11:24:01,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:01,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:01,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,794 INFO L87 Difference]: Start difference. First operand 2414 states and 3607 transitions. Second operand 3 states. [2019-12-07 11:24:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:01,869 INFO L93 Difference]: Finished difference Result 5109 states and 7653 transitions. [2019-12-07 11:24:01,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:01,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-12-07 11:24:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:01,875 INFO L225 Difference]: With dead ends: 5109 [2019-12-07 11:24:01,875 INFO L226 Difference]: Without dead ends: 2714 [2019-12-07 11:24:01,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:01,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2019-12-07 11:24:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2714. [2019-12-07 11:24:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-12-07 11:24:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 4060 transitions. [2019-12-07 11:24:01,914 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 4060 transitions. Word has length 308 [2019-12-07 11:24:01,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:01,914 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 4060 transitions. [2019-12-07 11:24:01,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 4060 transitions. [2019-12-07 11:24:01,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-12-07 11:24:01,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:01,918 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, 1, 1] [2019-12-07 11:24:01,918 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:01,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash -905095573, now seen corresponding path program 1 times [2019-12-07 11:24:01,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:01,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619148084] [2019-12-07 11:24:01,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-12-07 11:24:02,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619148084] [2019-12-07 11:24:02,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:02,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:02,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61007663] [2019-12-07 11:24:02,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:02,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:02,030 INFO L87 Difference]: Start difference. First operand 2714 states and 4060 transitions. Second operand 3 states. [2019-12-07 11:24:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:02,103 INFO L93 Difference]: Finished difference Result 5709 states and 8559 transitions. [2019-12-07 11:24:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:02,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2019-12-07 11:24:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:02,106 INFO L225 Difference]: With dead ends: 5709 [2019-12-07 11:24:02,106 INFO L226 Difference]: Without dead ends: 3014 [2019-12-07 11:24:02,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-12-07 11:24:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3014. [2019-12-07 11:24:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3014 states. [2019-12-07 11:24:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 4514 transitions. [2019-12-07 11:24:02,173 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 4514 transitions. Word has length 349 [2019-12-07 11:24:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:02,173 INFO L462 AbstractCegarLoop]: Abstraction has 3014 states and 4514 transitions. [2019-12-07 11:24:02,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 4514 transitions. [2019-12-07 11:24:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-12-07 11:24:02,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:02,177 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, 1, 1] [2019-12-07 11:24:02,177 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:02,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash -829902569, now seen corresponding path program 1 times [2019-12-07 11:24:02,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:02,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461010919] [2019-12-07 11:24:02,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-12-07 11:24:02,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461010919] [2019-12-07 11:24:02,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:02,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:02,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124067426] [2019-12-07 11:24:02,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:02,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:02,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:02,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:02,308 INFO L87 Difference]: Start difference. First operand 3014 states and 4514 transitions. Second operand 3 states. [2019-12-07 11:24:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:02,394 INFO L93 Difference]: Finished difference Result 6303 states and 9458 transitions. [2019-12-07 11:24:02,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:02,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-12-07 11:24:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:02,396 INFO L225 Difference]: With dead ends: 6303 [2019-12-07 11:24:02,397 INFO L226 Difference]: Without dead ends: 3308 [2019-12-07 11:24:02,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2019-12-07 11:24:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3308. [2019-12-07 11:24:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-12-07 11:24:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4949 transitions. [2019-12-07 11:24:02,443 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4949 transitions. Word has length 392 [2019-12-07 11:24:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:02,443 INFO L462 AbstractCegarLoop]: Abstraction has 3308 states and 4949 transitions. [2019-12-07 11:24:02,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4949 transitions. [2019-12-07 11:24:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-12-07 11:24:02,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:02,448 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:02,448 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1860937899, now seen corresponding path program 1 times [2019-12-07 11:24:02,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:02,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770262525] [2019-12-07 11:24:02,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-12-07 11:24:02,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770262525] [2019-12-07 11:24:02,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:02,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:02,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318571641] [2019-12-07 11:24:02,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:02,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:02,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:02,599 INFO L87 Difference]: Start difference. First operand 3308 states and 4949 transitions. Second operand 3 states. [2019-12-07 11:24:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:02,687 INFO L93 Difference]: Finished difference Result 6897 states and 10337 transitions. [2019-12-07 11:24:02,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:02,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 432 [2019-12-07 11:24:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:02,690 INFO L225 Difference]: With dead ends: 6897 [2019-12-07 11:24:02,690 INFO L226 Difference]: Without dead ends: 3608 [2019-12-07 11:24:02,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2019-12-07 11:24:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3608. [2019-12-07 11:24:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3608 states. [2019-12-07 11:24:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 5405 transitions. [2019-12-07 11:24:02,776 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 5405 transitions. Word has length 432 [2019-12-07 11:24:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:02,776 INFO L462 AbstractCegarLoop]: Abstraction has 3608 states and 5405 transitions. [2019-12-07 11:24:02,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 5405 transitions. [2019-12-07 11:24:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-12-07 11:24:02,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:02,781 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:02,781 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:02,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:02,781 INFO L82 PathProgramCache]: Analyzing trace with hash 970429942, now seen corresponding path program 1 times [2019-12-07 11:24:02,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:02,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68084857] [2019-12-07 11:24:02,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-12-07 11:24:02,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68084857] [2019-12-07 11:24:02,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:02,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:02,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171101356] [2019-12-07 11:24:02,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:02,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:02,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:02,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:02,953 INFO L87 Difference]: Start difference. First operand 3608 states and 5405 transitions. Second operand 3 states. [2019-12-07 11:24:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:03,037 INFO L93 Difference]: Finished difference Result 7497 states and 11249 transitions. [2019-12-07 11:24:03,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:03,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 474 [2019-12-07 11:24:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:03,040 INFO L225 Difference]: With dead ends: 7497 [2019-12-07 11:24:03,040 INFO L226 Difference]: Without dead ends: 3908 [2019-12-07 11:24:03,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-12-07 11:24:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3908. [2019-12-07 11:24:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3908 states. [2019-12-07 11:24:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5862 transitions. [2019-12-07 11:24:03,108 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5862 transitions. Word has length 474 [2019-12-07 11:24:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:03,108 INFO L462 AbstractCegarLoop]: Abstraction has 3908 states and 5862 transitions. [2019-12-07 11:24:03,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5862 transitions. [2019-12-07 11:24:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2019-12-07 11:24:03,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:03,113 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:03,113 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash 670606895, now seen corresponding path program 1 times [2019-12-07 11:24:03,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:03,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341391677] [2019-12-07 11:24:03,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1473 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-12-07 11:24:03,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341391677] [2019-12-07 11:24:03,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:03,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:03,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561897851] [2019-12-07 11:24:03,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:03,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:03,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:03,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:03,372 INFO L87 Difference]: Start difference. First operand 3908 states and 5862 transitions. Second operand 4 states. [2019-12-07 11:24:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:03,802 INFO L93 Difference]: Finished difference Result 9207 states and 13839 transitions. [2019-12-07 11:24:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:03,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 518 [2019-12-07 11:24:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:03,807 INFO L225 Difference]: With dead ends: 9207 [2019-12-07 11:24:03,807 INFO L226 Difference]: Without dead ends: 5318 [2019-12-07 11:24:03,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-12-07 11:24:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-12-07 11:24:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 4441. [2019-12-07 11:24:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4441 states. [2019-12-07 11:24:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4441 states to 4441 states and 6837 transitions. [2019-12-07 11:24:03,871 INFO L78 Accepts]: Start accepts. Automaton has 4441 states and 6837 transitions. Word has length 518 [2019-12-07 11:24:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:03,871 INFO L462 AbstractCegarLoop]: Abstraction has 4441 states and 6837 transitions. [2019-12-07 11:24:03,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4441 states and 6837 transitions. [2019-12-07 11:24:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2019-12-07 11:24:03,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:03,877 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:03,877 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:03,877 INFO L82 PathProgramCache]: Analyzing trace with hash -186219349, now seen corresponding path program 1 times [2019-12-07 11:24:03,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:03,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35615842] [2019-12-07 11:24:03,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-12-07 11:24:04,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35615842] [2019-12-07 11:24:04,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:04,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:04,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679068587] [2019-12-07 11:24:04,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:04,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:04,078 INFO L87 Difference]: Start difference. First operand 4441 states and 6837 transitions. Second operand 3 states. [2019-12-07 11:24:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:04,190 INFO L93 Difference]: Finished difference Result 9199 states and 14181 transitions. [2019-12-07 11:24:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:04,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 518 [2019-12-07 11:24:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:04,193 INFO L225 Difference]: With dead ends: 9199 [2019-12-07 11:24:04,194 INFO L226 Difference]: Without dead ends: 4777 [2019-12-07 11:24:04,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2019-12-07 11:24:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4777. [2019-12-07 11:24:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4777 states. [2019-12-07 11:24:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 7348 transitions. [2019-12-07 11:24:04,280 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 7348 transitions. Word has length 518 [2019-12-07 11:24:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:04,281 INFO L462 AbstractCegarLoop]: Abstraction has 4777 states and 7348 transitions. [2019-12-07 11:24:04,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 7348 transitions. [2019-12-07 11:24:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-12-07 11:24:04,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:04,289 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:04,290 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:04,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:04,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1574505539, now seen corresponding path program 1 times [2019-12-07 11:24:04,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:04,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267367283] [2019-12-07 11:24:04,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2962 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 2528 trivial. 0 not checked. [2019-12-07 11:24:04,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267367283] [2019-12-07 11:24:04,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:04,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:04,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066426864] [2019-12-07 11:24:04,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:04,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:04,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:04,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:04,562 INFO L87 Difference]: Start difference. First operand 4777 states and 7348 transitions. Second operand 3 states. [2019-12-07 11:24:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:04,661 INFO L93 Difference]: Finished difference Result 9876 states and 15210 transitions. [2019-12-07 11:24:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:04,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 559 [2019-12-07 11:24:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:04,664 INFO L225 Difference]: With dead ends: 9876 [2019-12-07 11:24:04,665 INFO L226 Difference]: Without dead ends: 5118 [2019-12-07 11:24:04,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2019-12-07 11:24:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5118. [2019-12-07 11:24:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5118 states. [2019-12-07 11:24:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 7882 transitions. [2019-12-07 11:24:04,735 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 7882 transitions. Word has length 559 [2019-12-07 11:24:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:04,735 INFO L462 AbstractCegarLoop]: Abstraction has 5118 states and 7882 transitions. [2019-12-07 11:24:04,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 7882 transitions. [2019-12-07 11:24:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2019-12-07 11:24:04,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:04,742 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:04,742 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash 267934050, now seen corresponding path program 1 times [2019-12-07 11:24:04,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:04,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502617605] [2019-12-07 11:24:04,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2019-12-07 11:24:05,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502617605] [2019-12-07 11:24:05,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:05,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:24:05,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205354968] [2019-12-07 11:24:05,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:24:05,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:05,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:24:05,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:05,010 INFO L87 Difference]: Start difference. First operand 5118 states and 7882 transitions. Second operand 3 states. [2019-12-07 11:24:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:05,108 INFO L93 Difference]: Finished difference Result 5461 states and 8419 transitions. [2019-12-07 11:24:05,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:24:05,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 602 [2019-12-07 11:24:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:05,111 INFO L225 Difference]: With dead ends: 5461 [2019-12-07 11:24:05,111 INFO L226 Difference]: Without dead ends: 5459 [2019-12-07 11:24:05,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:24:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5459 states. [2019-12-07 11:24:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5459 to 5459. [2019-12-07 11:24:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5459 states. [2019-12-07 11:24:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5459 states to 5459 states and 8417 transitions. [2019-12-07 11:24:05,184 INFO L78 Accepts]: Start accepts. Automaton has 5459 states and 8417 transitions. Word has length 602 [2019-12-07 11:24:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:05,185 INFO L462 AbstractCegarLoop]: Abstraction has 5459 states and 8417 transitions. [2019-12-07 11:24:05,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:24:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5459 states and 8417 transitions. [2019-12-07 11:24:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-12-07 11:24:05,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:05,192 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:05,192 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:05,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash -899423237, now seen corresponding path program 1 times [2019-12-07 11:24:05,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:05,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715767405] [2019-12-07 11:24:05,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 2676 proven. 480 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2019-12-07 11:24:06,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715767405] [2019-12-07 11:24:06,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587690492] [2019-12-07 11:24:06,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:24:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:07,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 11:24:07,047 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:24:07,114 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,115 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-12-07 11:24:07,115 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,150 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_164|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 11:24:07,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,181 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-12-07 11:24:07,182 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,219 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-12-07 11:24:07,219 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,255 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:24:07,255 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-12-07 11:24:07,256 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,265 INFO L534 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-12-07 11:24:07,265 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 11:24:07,303 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:24:07,304 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-12-07 11:24:07,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,309 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,309 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 11:24:07,336 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:24:07,337 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-12-07 11:24:07,337 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,342 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,343 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 11:24:07,345 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-12-07 11:24:07,348 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,363 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,397 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 11:24:07,397 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-12-07 11:24:07,398 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,406 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,406 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 11:24:07,430 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:24:07,430 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-12-07 11:24:07,431 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,436 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,436 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 11:24:07,456 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:24:07,457 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-12-07 11:24:07,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,463 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,463 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 11:24:07,467 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 11:24:07,469 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,513 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 11:24:07,513 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-12-07 11:24:07,514 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,521 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,521 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 11:24:07,525 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 11:24:07,527 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-12-07 11:24:07,528 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,608 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 11:24:07,608 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-12-07 11:24:07,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:24:07,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:24:07,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:24:07,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:24:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,636 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 11:24:07,707 INFO L614 ElimStorePlain]: treesize reduction 1116, result has 4.5 percent of original size [2019-12-07 11:24:07,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,707 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 11:24:07,710 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-12-07 11:24:07,711 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,755 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 11:24:07,755 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-12-07 11:24:07,756 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,763 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,763 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 11:24:07,767 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-12-07 11:24:07,769 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-12-07 11:24:07,770 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,856 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 11:24:07,856 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-12-07 11:24:07,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:24:07,859 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,880 INFO L614 ElimStorePlain]: treesize reduction 157, result has 25.2 percent of original size [2019-12-07 11:24:07,880 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,880 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 11:24:07,883 INFO L430 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-12-07 11:24:07,886 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-12-07 11:24:07,887 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,908 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-12-07 11:24:07,908 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:07,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,922 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,935 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-12-07 11:24:07,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:24:07,944 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-12-07 11:24:07,944 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,947 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:07,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:24:07,953 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:32 [2019-12-07 11:24:07,999 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:24:07,999 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-12-07 11:24:07,999 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:24:08,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:24:08,003 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:24:08,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 11:24:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 1428 proven. 91 refuted. 0 times theorem prover too weak. 2427 trivial. 0 not checked. [2019-12-07 11:24:08,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:24:08,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-12-07 11:24:08,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438578160] [2019-12-07 11:24:08,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:24:08,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:08,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:24:08,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:24:08,711 INFO L87 Difference]: Start difference. First operand 5459 states and 8417 transitions. Second operand 15 states. [2019-12-07 11:24:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:17,489 INFO L93 Difference]: Finished difference Result 55461 states and 85314 transitions. [2019-12-07 11:24:17,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 11:24:17,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 647 [2019-12-07 11:24:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:17,605 INFO L225 Difference]: With dead ends: 55461 [2019-12-07 11:24:17,605 INFO L226 Difference]: Without dead ends: 50021 [2019-12-07 11:24:17,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 653 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:24:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50021 states. [2019-12-07 11:24:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50021 to 43061. [2019-12-07 11:24:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-12-07 11:24:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67205 transitions. [2019-12-07 11:24:18,588 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67205 transitions. Word has length 647 [2019-12-07 11:24:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:18,588 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67205 transitions. [2019-12-07 11:24:18,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:24:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67205 transitions. [2019-12-07 11:24:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2019-12-07 11:24:18,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:18,655 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:18,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:24:18,856 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1304808224, now seen corresponding path program 1 times [2019-12-07 11:24:18,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:18,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086784599] [2019-12-07 11:24:18,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4069 backedges. 1306 proven. 0 refuted. 0 times theorem prover too weak. 2763 trivial. 0 not checked. [2019-12-07 11:24:19,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086784599] [2019-12-07 11:24:19,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:19,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:19,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856429333] [2019-12-07 11:24:19,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:19,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:19,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:19,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:19,206 INFO L87 Difference]: Start difference. First operand 43061 states and 67205 transitions. Second operand 4 states. [2019-12-07 11:24:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:20,265 INFO L93 Difference]: Finished difference Result 81737 states and 127199 transitions. [2019-12-07 11:24:20,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:20,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 656 [2019-12-07 11:24:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:20,306 INFO L225 Difference]: With dead ends: 81737 [2019-12-07 11:24:20,307 INFO L226 Difference]: Without dead ends: 44325 [2019-12-07 11:24:20,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44325 states. [2019-12-07 11:24:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44325 to 43061. [2019-12-07 11:24:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-12-07 11:24:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67157 transitions. [2019-12-07 11:24:21,046 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67157 transitions. Word has length 656 [2019-12-07 11:24:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:21,046 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67157 transitions. [2019-12-07 11:24:21,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67157 transitions. [2019-12-07 11:24:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-12-07 11:24:21,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:21,081 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:21,081 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1785509443, now seen corresponding path program 1 times [2019-12-07 11:24:21,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:21,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937227562] [2019-12-07 11:24:21,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4087 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 2763 trivial. 0 not checked. [2019-12-07 11:24:21,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937227562] [2019-12-07 11:24:21,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:21,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:21,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503358904] [2019-12-07 11:24:21,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:21,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:21,338 INFO L87 Difference]: Start difference. First operand 43061 states and 67157 transitions. Second operand 4 states. [2019-12-07 11:24:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:22,279 INFO L93 Difference]: Finished difference Result 81737 states and 127119 transitions. [2019-12-07 11:24:22,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:22,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 657 [2019-12-07 11:24:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:22,317 INFO L225 Difference]: With dead ends: 81737 [2019-12-07 11:24:22,317 INFO L226 Difference]: Without dead ends: 44325 [2019-12-07 11:24:22,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44325 states. [2019-12-07 11:24:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44325 to 43061. [2019-12-07 11:24:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-12-07 11:24:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67109 transitions. [2019-12-07 11:24:23,067 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67109 transitions. Word has length 657 [2019-12-07 11:24:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:23,067 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67109 transitions. [2019-12-07 11:24:23,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67109 transitions. [2019-12-07 11:24:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2019-12-07 11:24:23,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:23,100 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:23,100 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1195800389, now seen corresponding path program 1 times [2019-12-07 11:24:23,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:23,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966909320] [2019-12-07 11:24:23,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 2763 trivial. 0 not checked. [2019-12-07 11:24:23,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966909320] [2019-12-07 11:24:23,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:23,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:23,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683563041] [2019-12-07 11:24:23,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:23,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:23,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:23,500 INFO L87 Difference]: Start difference. First operand 43061 states and 67109 transitions. Second operand 4 states. [2019-12-07 11:24:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:24,393 INFO L93 Difference]: Finished difference Result 81737 states and 127039 transitions. [2019-12-07 11:24:24,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:24,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 658 [2019-12-07 11:24:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:24,430 INFO L225 Difference]: With dead ends: 81737 [2019-12-07 11:24:24,431 INFO L226 Difference]: Without dead ends: 44325 [2019-12-07 11:24:24,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44325 states. [2019-12-07 11:24:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44325 to 43061. [2019-12-07 11:24:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-12-07 11:24:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67061 transitions. [2019-12-07 11:24:25,186 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67061 transitions. Word has length 658 [2019-12-07 11:24:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:25,186 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67061 transitions. [2019-12-07 11:24:25,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67061 transitions. [2019-12-07 11:24:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2019-12-07 11:24:25,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:25,219 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:25,219 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:25,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1805587320, now seen corresponding path program 1 times [2019-12-07 11:24:25,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:25,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135368291] [2019-12-07 11:24:25,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 1360 proven. 0 refuted. 0 times theorem prover too weak. 2763 trivial. 0 not checked. [2019-12-07 11:24:25,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135368291] [2019-12-07 11:24:25,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:25,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:25,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4769556] [2019-12-07 11:24:25,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:25,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:25,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:25,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:25,596 INFO L87 Difference]: Start difference. First operand 43061 states and 67061 transitions. Second operand 4 states. [2019-12-07 11:24:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:26,465 INFO L93 Difference]: Finished difference Result 81577 states and 126767 transitions. [2019-12-07 11:24:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:26,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 659 [2019-12-07 11:24:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:26,501 INFO L225 Difference]: With dead ends: 81577 [2019-12-07 11:24:26,501 INFO L226 Difference]: Without dead ends: 44165 [2019-12-07 11:24:26,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44165 states. [2019-12-07 11:24:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44165 to 43061. [2019-12-07 11:24:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43061 states. [2019-12-07 11:24:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43061 states to 43061 states and 67013 transitions. [2019-12-07 11:24:27,252 INFO L78 Accepts]: Start accepts. Automaton has 43061 states and 67013 transitions. Word has length 659 [2019-12-07 11:24:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:27,252 INFO L462 AbstractCegarLoop]: Abstraction has 43061 states and 67013 transitions. [2019-12-07 11:24:27,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 43061 states and 67013 transitions. [2019-12-07 11:24:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-12-07 11:24:27,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:27,284 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:27,285 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:27,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:27,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1505347909, now seen corresponding path program 1 times [2019-12-07 11:24:27,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:27,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543816379] [2019-12-07 11:24:27,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4069 backedges. 1610 proven. 0 refuted. 0 times theorem prover too weak. 2459 trivial. 0 not checked. [2019-12-07 11:24:27,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543816379] [2019-12-07 11:24:27,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:27,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:24:27,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387705987] [2019-12-07 11:24:27,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:24:27,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:27,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:24:27,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:27,655 INFO L87 Difference]: Start difference. First operand 43061 states and 67013 transitions. Second operand 5 states. [2019-12-07 11:24:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:28,951 INFO L93 Difference]: Finished difference Result 101277 states and 158140 transitions. [2019-12-07 11:24:28,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:28,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 662 [2019-12-07 11:24:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:29,004 INFO L225 Difference]: With dead ends: 101277 [2019-12-07 11:24:29,004 INFO L226 Difference]: Without dead ends: 58235 [2019-12-07 11:24:29,028 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-12-07 11:24:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58235 states. [2019-12-07 11:24:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58235 to 47253. [2019-12-07 11:24:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47253 states. [2019-12-07 11:24:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47253 states to 47253 states and 74773 transitions. [2019-12-07 11:24:29,876 INFO L78 Accepts]: Start accepts. Automaton has 47253 states and 74773 transitions. Word has length 662 [2019-12-07 11:24:29,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:29,876 INFO L462 AbstractCegarLoop]: Abstraction has 47253 states and 74773 transitions. [2019-12-07 11:24:29,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:24:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 47253 states and 74773 transitions. [2019-12-07 11:24:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-12-07 11:24:29,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:29,912 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:29,912 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:29,912 INFO L82 PathProgramCache]: Analyzing trace with hash -755305953, now seen corresponding path program 2 times [2019-12-07 11:24:29,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:29,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168556793] [2019-12-07 11:24:29,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4069 backedges. 1024 proven. 0 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2019-12-07 11:24:30,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168556793] [2019-12-07 11:24:30,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:30,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:24:30,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534501225] [2019-12-07 11:24:30,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:24:30,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:30,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:24:30,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:24:30,311 INFO L87 Difference]: Start difference. First operand 47253 states and 74773 transitions. Second operand 6 states. [2019-12-07 11:24:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:32,264 INFO L93 Difference]: Finished difference Result 118579 states and 185491 transitions. [2019-12-07 11:24:32,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:24:32,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 662 [2019-12-07 11:24:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:32,325 INFO L225 Difference]: With dead ends: 118579 [2019-12-07 11:24:32,325 INFO L226 Difference]: Without dead ends: 71345 [2019-12-07 11:24:32,352 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-12-07 11:24:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71345 states. [2019-12-07 11:24:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71345 to 50997. [2019-12-07 11:24:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50997 states. [2019-12-07 11:24:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50997 states to 50997 states and 80565 transitions. [2019-12-07 11:24:33,372 INFO L78 Accepts]: Start accepts. Automaton has 50997 states and 80565 transitions. Word has length 662 [2019-12-07 11:24:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:33,372 INFO L462 AbstractCegarLoop]: Abstraction has 50997 states and 80565 transitions. [2019-12-07 11:24:33,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:24:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 50997 states and 80565 transitions. [2019-12-07 11:24:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-12-07 11:24:33,423 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:33,424 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:33,424 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:33,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1983545129, now seen corresponding path program 1 times [2019-12-07 11:24:33,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:33,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367908575] [2019-12-07 11:24:33,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4081 backedges. 1622 proven. 0 refuted. 0 times theorem prover too weak. 2459 trivial. 0 not checked. [2019-12-07 11:24:33,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367908575] [2019-12-07 11:24:33,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:33,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:24:33,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398089144] [2019-12-07 11:24:33,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:24:33,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:33,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:24:33,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:33,874 INFO L87 Difference]: Start difference. First operand 50997 states and 80565 transitions. Second operand 5 states. [2019-12-07 11:24:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:35,220 INFO L93 Difference]: Finished difference Result 111805 states and 175273 transitions. [2019-12-07 11:24:35,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:35,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 663 [2019-12-07 11:24:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:35,273 INFO L225 Difference]: With dead ends: 111805 [2019-12-07 11:24:35,273 INFO L226 Difference]: Without dead ends: 60827 [2019-12-07 11:24:35,298 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-12-07 11:24:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60827 states. [2019-12-07 11:24:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60827 to 51173. [2019-12-07 11:24:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:24:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 80485 transitions. [2019-12-07 11:24:36,283 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 80485 transitions. Word has length 663 [2019-12-07 11:24:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:36,283 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 80485 transitions. [2019-12-07 11:24:36,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:24:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 80485 transitions. [2019-12-07 11:24:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2019-12-07 11:24:36,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:36,320 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:36,321 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 333227753, now seen corresponding path program 1 times [2019-12-07 11:24:36,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:36,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750079645] [2019-12-07 11:24:36,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4101 backedges. 846 proven. 0 refuted. 0 times theorem prover too weak. 3255 trivial. 0 not checked. [2019-12-07 11:24:36,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750079645] [2019-12-07 11:24:36,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:36,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:36,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57000234] [2019-12-07 11:24:36,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:36,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:36,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:36,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:36,639 INFO L87 Difference]: Start difference. First operand 51173 states and 80485 transitions. Second operand 4 states. [2019-12-07 11:24:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:37,962 INFO L93 Difference]: Finished difference Result 104895 states and 163748 transitions. [2019-12-07 11:24:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:37,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 664 [2019-12-07 11:24:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:38,018 INFO L225 Difference]: With dead ends: 104895 [2019-12-07 11:24:38,018 INFO L226 Difference]: Without dead ends: 60155 [2019-12-07 11:24:38,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60155 states. [2019-12-07 11:24:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60155 to 51173. [2019-12-07 11:24:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:24:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 80341 transitions. [2019-12-07 11:24:39,029 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 80341 transitions. Word has length 664 [2019-12-07 11:24:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:39,029 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 80341 transitions. [2019-12-07 11:24:39,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 80341 transitions. [2019-12-07 11:24:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2019-12-07 11:24:39,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:39,066 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:39,066 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:39,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1807211375, now seen corresponding path program 1 times [2019-12-07 11:24:39,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:39,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404314823] [2019-12-07 11:24:39,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4119 backedges. 864 proven. 0 refuted. 0 times theorem prover too weak. 3255 trivial. 0 not checked. [2019-12-07 11:24:39,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404314823] [2019-12-07 11:24:39,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:39,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:39,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849715329] [2019-12-07 11:24:39,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:39,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:39,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:39,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:39,335 INFO L87 Difference]: Start difference. First operand 51173 states and 80341 transitions. Second operand 4 states. [2019-12-07 11:24:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:40,770 INFO L93 Difference]: Finished difference Result 104895 states and 163476 transitions. [2019-12-07 11:24:40,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:40,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 665 [2019-12-07 11:24:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:40,828 INFO L225 Difference]: With dead ends: 104895 [2019-12-07 11:24:40,829 INFO L226 Difference]: Without dead ends: 60155 [2019-12-07 11:24:40,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:40,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60155 states. [2019-12-07 11:24:41,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60155 to 51173. [2019-12-07 11:24:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:24:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 80197 transitions. [2019-12-07 11:24:41,857 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 80197 transitions. Word has length 665 [2019-12-07 11:24:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:41,857 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 80197 transitions. [2019-12-07 11:24:41,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 80197 transitions. [2019-12-07 11:24:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-12-07 11:24:41,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:41,895 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:41,895 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2094469060, now seen corresponding path program 1 times [2019-12-07 11:24:41,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:41,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923336600] [2019-12-07 11:24:41,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4137 backedges. 882 proven. 0 refuted. 0 times theorem prover too weak. 3255 trivial. 0 not checked. [2019-12-07 11:24:42,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923336600] [2019-12-07 11:24:42,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:42,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:42,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179973872] [2019-12-07 11:24:42,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:42,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:42,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:42,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:42,155 INFO L87 Difference]: Start difference. First operand 51173 states and 80197 transitions. Second operand 4 states. [2019-12-07 11:24:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:43,565 INFO L93 Difference]: Finished difference Result 104575 states and 162820 transitions. [2019-12-07 11:24:43,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:43,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 666 [2019-12-07 11:24:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:43,620 INFO L225 Difference]: With dead ends: 104575 [2019-12-07 11:24:43,621 INFO L226 Difference]: Without dead ends: 59835 [2019-12-07 11:24:43,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59835 states. [2019-12-07 11:24:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59835 to 51173. [2019-12-07 11:24:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:24:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 80053 transitions. [2019-12-07 11:24:44,647 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 80053 transitions. Word has length 666 [2019-12-07 11:24:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:44,647 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 80053 transitions. [2019-12-07 11:24:44,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 80053 transitions. [2019-12-07 11:24:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-12-07 11:24:44,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:44,685 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:44,685 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:44,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1181196976, now seen corresponding path program 1 times [2019-12-07 11:24:44,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:44,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562937406] [2019-12-07 11:24:44,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4285 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 3360 trivial. 0 not checked. [2019-12-07 11:24:44,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562937406] [2019-12-07 11:24:44,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:44,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:44,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871696549] [2019-12-07 11:24:44,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:44,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:44,953 INFO L87 Difference]: Start difference. First operand 51173 states and 80053 transitions. Second operand 4 states. [2019-12-07 11:24:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:46,369 INFO L93 Difference]: Finished difference Result 110989 states and 172606 transitions. [2019-12-07 11:24:46,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:46,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 676 [2019-12-07 11:24:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:46,421 INFO L225 Difference]: With dead ends: 110989 [2019-12-07 11:24:46,422 INFO L226 Difference]: Without dead ends: 59835 [2019-12-07 11:24:46,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59835 states. [2019-12-07 11:24:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59835 to 51173. [2019-12-07 11:24:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:24:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79909 transitions. [2019-12-07 11:24:47,614 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79909 transitions. Word has length 676 [2019-12-07 11:24:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:47,614 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79909 transitions. [2019-12-07 11:24:47,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79909 transitions. [2019-12-07 11:24:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-12-07 11:24:47,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:47,651 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:47,651 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:47,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:47,651 INFO L82 PathProgramCache]: Analyzing trace with hash 309287547, now seen corresponding path program 1 times [2019-12-07 11:24:47,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:47,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47088905] [2019-12-07 11:24:47,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4303 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 3360 trivial. 0 not checked. [2019-12-07 11:24:47,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47088905] [2019-12-07 11:24:47,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:47,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:47,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807450973] [2019-12-07 11:24:47,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:47,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:47,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:47,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:47,910 INFO L87 Difference]: Start difference. First operand 51173 states and 79909 transitions. Second operand 4 states. [2019-12-07 11:24:49,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:49,323 INFO L93 Difference]: Finished difference Result 110765 states and 172094 transitions. [2019-12-07 11:24:49,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:49,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 677 [2019-12-07 11:24:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:49,373 INFO L225 Difference]: With dead ends: 110765 [2019-12-07 11:24:49,373 INFO L226 Difference]: Without dead ends: 59611 [2019-12-07 11:24:49,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59611 states. [2019-12-07 11:24:50,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59611 to 51173. [2019-12-07 11:24:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:24:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79765 transitions. [2019-12-07 11:24:50,445 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79765 transitions. Word has length 677 [2019-12-07 11:24:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:50,445 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79765 transitions. [2019-12-07 11:24:50,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79765 transitions. [2019-12-07 11:24:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-12-07 11:24:50,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:50,483 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:50,484 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:50,484 INFO L82 PathProgramCache]: Analyzing trace with hash 901344059, now seen corresponding path program 1 times [2019-12-07 11:24:50,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:50,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48366526] [2019-12-07 11:24:50,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4321 backedges. 1030 proven. 0 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2019-12-07 11:24:50,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48366526] [2019-12-07 11:24:50,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:50,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:50,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060998424] [2019-12-07 11:24:50,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:50,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:50,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:50,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:50,812 INFO L87 Difference]: Start difference. First operand 51173 states and 79765 transitions. Second operand 4 states. [2019-12-07 11:24:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:52,309 INFO L93 Difference]: Finished difference Result 102735 states and 158356 transitions. [2019-12-07 11:24:52,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:52,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 677 [2019-12-07 11:24:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:52,360 INFO L225 Difference]: With dead ends: 102735 [2019-12-07 11:24:52,360 INFO L226 Difference]: Without dead ends: 57995 [2019-12-07 11:24:52,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57995 states. [2019-12-07 11:24:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57995 to 51173. [2019-12-07 11:24:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:24:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79621 transitions. [2019-12-07 11:24:53,438 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79621 transitions. Word has length 677 [2019-12-07 11:24:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:53,438 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79621 transitions. [2019-12-07 11:24:53,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79621 transitions. [2019-12-07 11:24:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2019-12-07 11:24:53,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:53,475 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:53,476 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:53,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:53,476 INFO L82 PathProgramCache]: Analyzing trace with hash 400542018, now seen corresponding path program 1 times [2019-12-07 11:24:53,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:53,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041690649] [2019-12-07 11:24:53,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 1049 proven. 0 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2019-12-07 11:24:53,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041690649] [2019-12-07 11:24:53,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:53,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:53,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287750161] [2019-12-07 11:24:53,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:53,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:53,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:53,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:53,732 INFO L87 Difference]: Start difference. First operand 51173 states and 79621 transitions. Second operand 4 states. [2019-12-07 11:24:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:55,304 INFO L93 Difference]: Finished difference Result 102735 states and 158084 transitions. [2019-12-07 11:24:55,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:55,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 678 [2019-12-07 11:24:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:55,458 INFO L225 Difference]: With dead ends: 102735 [2019-12-07 11:24:55,459 INFO L226 Difference]: Without dead ends: 57995 [2019-12-07 11:24:55,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57995 states. [2019-12-07 11:24:56,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57995 to 51173. [2019-12-07 11:24:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:24:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79477 transitions. [2019-12-07 11:24:56,500 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79477 transitions. Word has length 678 [2019-12-07 11:24:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:56,500 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79477 transitions. [2019-12-07 11:24:56,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79477 transitions. [2019-12-07 11:24:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2019-12-07 11:24:56,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:56,537 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:56,537 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash -401013706, now seen corresponding path program 1 times [2019-12-07 11:24:56,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:56,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484724107] [2019-12-07 11:24:56,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4359 backedges. 1068 proven. 0 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2019-12-07 11:24:56,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484724107] [2019-12-07 11:24:56,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:56,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:56,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34520106] [2019-12-07 11:24:56,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:56,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:56,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:56,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:56,795 INFO L87 Difference]: Start difference. First operand 51173 states and 79477 transitions. Second operand 4 states. [2019-12-07 11:24:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:58,337 INFO L93 Difference]: Finished difference Result 102735 states and 157812 transitions. [2019-12-07 11:24:58,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:24:58,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 679 [2019-12-07 11:24:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:58,387 INFO L225 Difference]: With dead ends: 102735 [2019-12-07 11:24:58,387 INFO L226 Difference]: Without dead ends: 57995 [2019-12-07 11:24:58,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57995 states. [2019-12-07 11:24:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57995 to 51173. [2019-12-07 11:24:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:24:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79333 transitions. [2019-12-07 11:24:59,507 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79333 transitions. Word has length 679 [2019-12-07 11:24:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:59,507 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79333 transitions. [2019-12-07 11:24:59,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:24:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79333 transitions. [2019-12-07 11:24:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2019-12-07 11:24:59,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:24:59,544 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:24:59,545 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:24:59,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:24:59,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1935999011, now seen corresponding path program 1 times [2019-12-07 11:24:59,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:24:59,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395117044] [2019-12-07 11:24:59,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:24:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:24:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4378 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2019-12-07 11:24:59,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395117044] [2019-12-07 11:24:59,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:24:59,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:24:59,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718943551] [2019-12-07 11:24:59,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:24:59,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:24:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:24:59,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:24:59,870 INFO L87 Difference]: Start difference. First operand 51173 states and 79333 transitions. Second operand 4 states. [2019-12-07 11:25:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:01,480 INFO L93 Difference]: Finished difference Result 102415 states and 157156 transitions. [2019-12-07 11:25:01,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:01,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 680 [2019-12-07 11:25:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:01,536 INFO L225 Difference]: With dead ends: 102415 [2019-12-07 11:25:01,536 INFO L226 Difference]: Without dead ends: 57675 [2019-12-07 11:25:01,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57675 states. [2019-12-07 11:25:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57675 to 51173. [2019-12-07 11:25:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:25:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79189 transitions. [2019-12-07 11:25:02,686 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79189 transitions. Word has length 680 [2019-12-07 11:25:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:02,686 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79189 transitions. [2019-12-07 11:25:02,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79189 transitions. [2019-12-07 11:25:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-12-07 11:25:02,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:02,724 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:02,724 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash -141517246, now seen corresponding path program 1 times [2019-12-07 11:25:02,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:25:02,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10353402] [2019-12-07 11:25:02,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4492 backedges. 882 proven. 0 refuted. 0 times theorem prover too weak. 3610 trivial. 0 not checked. [2019-12-07 11:25:03,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10353402] [2019-12-07 11:25:03,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:03,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:25:03,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126949974] [2019-12-07 11:25:03,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:03,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:25:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:03,029 INFO L87 Difference]: Start difference. First operand 51173 states and 79189 transitions. Second operand 4 states. [2019-12-07 11:25:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:04,550 INFO L93 Difference]: Finished difference Result 107703 states and 165656 transitions. [2019-12-07 11:25:04,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:04,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 689 [2019-12-07 11:25:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:04,597 INFO L225 Difference]: With dead ends: 107703 [2019-12-07 11:25:04,597 INFO L226 Difference]: Without dead ends: 56549 [2019-12-07 11:25:04,615 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-12-07 11:25:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56549 states. [2019-12-07 11:25:05,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56549 to 51173. [2019-12-07 11:25:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:25:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 79045 transitions. [2019-12-07 11:25:05,716 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 79045 transitions. Word has length 689 [2019-12-07 11:25:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:05,716 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 79045 transitions. [2019-12-07 11:25:05,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 79045 transitions. [2019-12-07 11:25:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-12-07 11:25:05,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:05,754 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:05,754 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash 122925779, now seen corresponding path program 1 times [2019-12-07 11:25:05,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:25:05,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880839085] [2019-12-07 11:25:05,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4505 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 3610 trivial. 0 not checked. [2019-12-07 11:25:06,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880839085] [2019-12-07 11:25:06,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:06,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:25:06,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122298787] [2019-12-07 11:25:06,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:06,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:25:06,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:06,061 INFO L87 Difference]: Start difference. First operand 51173 states and 79045 transitions. Second operand 4 states. [2019-12-07 11:25:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:07,551 INFO L93 Difference]: Finished difference Result 107479 states and 165144 transitions. [2019-12-07 11:25:07,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:07,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2019-12-07 11:25:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:07,598 INFO L225 Difference]: With dead ends: 107479 [2019-12-07 11:25:07,598 INFO L226 Difference]: Without dead ends: 56325 [2019-12-07 11:25:07,623 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-12-07 11:25:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56325 states. [2019-12-07 11:25:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56325 to 51173. [2019-12-07 11:25:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:25:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 78901 transitions. [2019-12-07 11:25:08,820 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 78901 transitions. Word has length 690 [2019-12-07 11:25:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:08,820 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 78901 transitions. [2019-12-07 11:25:08,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 78901 transitions. [2019-12-07 11:25:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-12-07 11:25:08,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:08,856 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:08,856 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1251979088, now seen corresponding path program 1 times [2019-12-07 11:25:08,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:25:08,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367026289] [2019-12-07 11:25:08,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4499 backedges. 905 proven. 0 refuted. 0 times theorem prover too weak. 3594 trivial. 0 not checked. [2019-12-07 11:25:09,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367026289] [2019-12-07 11:25:09,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:09,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:25:09,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890340370] [2019-12-07 11:25:09,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:09,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:25:09,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:09,171 INFO L87 Difference]: Start difference. First operand 51173 states and 78901 transitions. Second operand 4 states. [2019-12-07 11:25:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:10,650 INFO L93 Difference]: Finished difference Result 107047 states and 164280 transitions. [2019-12-07 11:25:10,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:10,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2019-12-07 11:25:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:10,698 INFO L225 Difference]: With dead ends: 107047 [2019-12-07 11:25:10,698 INFO L226 Difference]: Without dead ends: 55893 [2019-12-07 11:25:10,723 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-12-07 11:25:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55893 states. [2019-12-07 11:25:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55893 to 51173. [2019-12-07 11:25:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:25:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 78757 transitions. [2019-12-07 11:25:11,861 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 78757 transitions. Word has length 690 [2019-12-07 11:25:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:11,862 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 78757 transitions. [2019-12-07 11:25:11,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 78757 transitions. [2019-12-07 11:25:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-12-07 11:25:11,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:11,900 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:11,900 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash 595968553, now seen corresponding path program 1 times [2019-12-07 11:25:11,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:25:11,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454663506] [2019-12-07 11:25:11,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4534 backedges. 1138 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-12-07 11:25:12,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454663506] [2019-12-07 11:25:12,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:12,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:25:12,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310865980] [2019-12-07 11:25:12,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:12,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:25:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:12,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:12,167 INFO L87 Difference]: Start difference. First operand 51173 states and 78757 transitions. Second operand 4 states. [2019-12-07 11:25:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:13,885 INFO L93 Difference]: Finished difference Result 108829 states and 165982 transitions. [2019-12-07 11:25:13,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:13,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2019-12-07 11:25:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:13,934 INFO L225 Difference]: With dead ends: 108829 [2019-12-07 11:25:13,935 INFO L226 Difference]: Without dead ends: 57675 [2019-12-07 11:25:13,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57675 states. [2019-12-07 11:25:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57675 to 51173. [2019-12-07 11:25:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51173 states. [2019-12-07 11:25:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51173 states to 51173 states and 78613 transitions. [2019-12-07 11:25:15,111 INFO L78 Accepts]: Start accepts. Automaton has 51173 states and 78613 transitions. Word has length 690 [2019-12-07 11:25:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:15,111 INFO L462 AbstractCegarLoop]: Abstraction has 51173 states and 78613 transitions. [2019-12-07 11:25:15,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 51173 states and 78613 transitions. [2019-12-07 11:25:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-12-07 11:25:15,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:15,148 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 16, 15, 14, 14, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:15,148 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:15,148 INFO L82 PathProgramCache]: Analyzing trace with hash -48582669, now seen corresponding path program 1 times [2019-12-07 11:25:15,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:25:15,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877519130] [2019-12-07 11:25:15,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4507 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2019-12-07 11:25:15,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877519130] [2019-12-07 11:25:15,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:15,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:25:15,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799807659] [2019-12-07 11:25:15,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:15,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:25:15,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:15,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:15,422 INFO L87 Difference]: Start difference. First operand 51173 states and 78613 transitions. Second operand 4 states. [2019-12-07 11:25:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:16,786 INFO L93 Difference]: Finished difference Result 104455 states and 160099 transitions. [2019-12-07 11:25:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:16,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2019-12-07 11:25:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:16,839 INFO L225 Difference]: With dead ends: 104455 [2019-12-07 11:25:16,840 INFO L226 Difference]: Without dead ends: 53301 [2019-12-07 11:25:16,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53301 states. [2019-12-07 11:25:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53301 to 51157. [2019-12-07 11:25:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51157 states. [2019-12-07 11:25:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51157 states to 51157 states and 78453 transitions. [2019-12-07 11:25:18,086 INFO L78 Accepts]: Start accepts. Automaton has 51157 states and 78453 transitions. Word has length 690 [2019-12-07 11:25:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:18,086 INFO L462 AbstractCegarLoop]: Abstraction has 51157 states and 78453 transitions. [2019-12-07 11:25:18,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 51157 states and 78453 transitions. [2019-12-07 11:25:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-12-07 11:25:18,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:18,124 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 18, 17, 17, 17, 16, 16, 15, 15, 15, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:18,124 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash -433155902, now seen corresponding path program 1 times [2019-12-07 11:25:18,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:25:18,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127949041] [2019-12-07 11:25:18,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4553 backedges. 1157 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-12-07 11:25:18,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127949041] [2019-12-07 11:25:18,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:18,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:25:18,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440220997] [2019-12-07 11:25:18,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:18,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:25:18,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:18,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:18,393 INFO L87 Difference]: Start difference. First operand 51157 states and 78453 transitions. Second operand 4 states. [2019-12-07 11:25:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:20,111 INFO L93 Difference]: Finished difference Result 108573 states and 165150 transitions. [2019-12-07 11:25:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:20,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 691 [2019-12-07 11:25:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:20,161 INFO L225 Difference]: With dead ends: 108573 [2019-12-07 11:25:20,161 INFO L226 Difference]: Without dead ends: 57435 [2019-12-07 11:25:20,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57435 states. [2019-12-07 11:25:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57435 to 51157. [2019-12-07 11:25:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51157 states. [2019-12-07 11:25:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51157 states to 51157 states and 78309 transitions. [2019-12-07 11:25:21,381 INFO L78 Accepts]: Start accepts. Automaton has 51157 states and 78309 transitions. Word has length 691 [2019-12-07 11:25:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:21,381 INFO L462 AbstractCegarLoop]: Abstraction has 51157 states and 78309 transitions. [2019-12-07 11:25:21,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 51157 states and 78309 transitions. [2019-12-07 11:25:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-12-07 11:25:21,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:21,418 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:21,419 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:21,419 INFO L82 PathProgramCache]: Analyzing trace with hash 984903532, now seen corresponding path program 1 times [2019-12-07 11:25:21,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:25:21,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022175845] [2019-12-07 11:25:21,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:25:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4518 backedges. 2550 proven. 164 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2019-12-07 11:25:21,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022175845] [2019-12-07 11:25:21,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516044647] [2019-12-07 11:25:21,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:25:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:22,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 2219 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:25:22,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:22,275 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-12-07 11:25:22,276 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:22,277 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:22,277 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:25:22,277 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 11:25:22,287 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_161|], 5=[|v_#memory_int_179|]} [2019-12-07 11:25:22,288 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-12-07 11:25:22,288 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:25:22,291 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:22,292 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-12-07 11:25:22,292 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:25:22,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:22,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:22,317 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-12-07 11:25:22,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:22,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:25:22,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:22,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:25:22,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:25:22,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:25:22,322 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7be9bc87 [2019-12-07 11:25:22,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:25:22,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-12-07 11:25:22,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13315666] [2019-12-07 11:25:22,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:25:22,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:25:22,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:25:22,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:25:22,323 INFO L87 Difference]: Start difference. First operand 51157 states and 78309 transitions. Second operand 8 states. [2019-12-07 11:25:22,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:25:22,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:25:22,525 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7be9bc87 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-07 11:25:22,530 INFO L168 Benchmark]: Toolchain (without parser) took 99049.40 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 939.2 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 11:25:22,530 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:25:22,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:22,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:22,532 INFO L168 Benchmark]: Boogie Preprocessor took 56.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:22,532 INFO L168 Benchmark]: RCFGBuilder took 671.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.7 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:22,533 INFO L168 Benchmark]: TraceAbstraction took 97832.12 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 959.7 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 11:25:22,536 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 671.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.7 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 97832.12 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 959.7 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7be9bc87 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7be9bc87: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 11:25:24,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:25:24,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:25:24,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:25:24,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:25:24,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:25:24,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:25:24,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:25:24,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:25:24,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:25:24,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:25:24,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:25:24,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:25:24,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:25:24,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:25:24,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:25:24,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:25:24,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:25:24,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:25:24,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:25:24,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:25:24,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:25:24,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:25:24,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:25:24,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:25:24,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:25:24,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:25:24,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:25:24,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:25:24,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:25:24,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:25:24,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:25:24,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:25:24,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:25:24,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:25:24,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:25:24,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:25:24,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:25:24,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:25:24,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:25:24,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:25:24,045 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 11:25:24,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:25:24,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:25:24,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:25:24,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:25:24,058 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:25:24,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:25:24,058 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:25:24,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:25:24,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:25:24,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:25:24,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:25:24,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:25:24,059 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:25:24,059 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:25:24,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:25:24,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:25:24,060 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:25:24,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:25:24,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:25:24,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:25:24,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:25:24,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:25:24,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:25:24,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:25:24,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:25:24,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:25:24,061 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 11:25:24,061 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:25:24,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:25:24,062 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:25:24,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:25:24,062 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_22236261-f161-4d7c-8850-8b7fd0946764/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 -> 3120445556e880fbad518fab0e301c4c6b39e1cb [2019-12-07 11:25:24,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:25:24,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:25:24,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:25:24,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:25:24,241 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:25:24,242 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c [2019-12-07 11:25:24,281 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data/0171789ca/2c5dc27e808d4dc0a3cfa37a885a2047/FLAG18674e05f [2019-12-07 11:25:24,689 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:25:24,689 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-2.c [2019-12-07 11:25:24,702 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data/0171789ca/2c5dc27e808d4dc0a3cfa37a885a2047/FLAG18674e05f [2019-12-07 11:25:24,710 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/data/0171789ca/2c5dc27e808d4dc0a3cfa37a885a2047 [2019-12-07 11:25:24,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:25:24,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:25:24,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:25:24,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:25:24,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:25:24,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:25:24" (1/1) ... [2019-12-07 11:25:24,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10831c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:24, skipping insertion in model container [2019-12-07 11:25:24,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:25:24" (1/1) ... [2019-12-07 11:25:24,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:25:24,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:25:25,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:25:25,050 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:25:25,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:25:25,149 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:25:25,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25 WrapperNode [2019-12-07 11:25:25,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:25:25,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:25:25,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:25:25,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:25:25,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... [2019-12-07 11:25:25,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... [2019-12-07 11:25:25,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:25:25,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:25:25,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:25:25,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:25:25,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... [2019-12-07 11:25:25,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... [2019-12-07 11:25:25,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... [2019-12-07 11:25:25,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... [2019-12-07 11:25:25,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... [2019-12-07 11:25:25,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... [2019-12-07 11:25:25,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... [2019-12-07 11:25:25,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:25:25,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:25:25,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:25:25,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:25:25,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:25:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:25:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:25:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 11:25:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:25:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:25:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:25:25,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:25:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 11:25:25,459 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:25:27,270 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 11:25:27,270 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 11:25:27,271 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:25:27,271 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:25:27,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:25:27 BoogieIcfgContainer [2019-12-07 11:25:27,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:25:27,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:25:27,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:25:27,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:25:27,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:25:24" (1/3) ... [2019-12-07 11:25:27,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3050d4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:25:27, skipping insertion in model container [2019-12-07 11:25:27,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:25:25" (2/3) ... [2019-12-07 11:25:27,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3050d4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:25:27, skipping insertion in model container [2019-12-07 11:25:27,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:25:27" (3/3) ... [2019-12-07 11:25:27,277 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-2.c [2019-12-07 11:25:27,283 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:25:27,288 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:25:27,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:25:27,313 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:25:27,313 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:25:27,314 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:25:27,314 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:25:27,314 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:25:27,314 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:25:27,314 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:25:27,314 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:25:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-12-07 11:25:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 11:25:27,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:27,335 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, 1, 1] [2019-12-07 11:25:27,335 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1128889191, now seen corresponding path program 1 times [2019-12-07 11:25:27,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:27,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053838746] [2019-12-07 11:25:27,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:27,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:25:27,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:25:27,507 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:25:27,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053838746] [2019-12-07 11:25:27,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:27,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:25:27,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125918542] [2019-12-07 11:25:27,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:27,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:27,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:27,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:27,541 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-12-07 11:25:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:27,707 INFO L93 Difference]: Finished difference Result 596 states and 1029 transitions. [2019-12-07 11:25:27,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:27,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 11:25:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:27,724 INFO L225 Difference]: With dead ends: 596 [2019-12-07 11:25:27,724 INFO L226 Difference]: Without dead ends: 408 [2019-12-07 11:25:27,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-12-07 11:25:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-12-07 11:25:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 11:25:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 626 transitions. [2019-12-07 11:25:27,782 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 626 transitions. Word has length 44 [2019-12-07 11:25:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:27,782 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 626 transitions. [2019-12-07 11:25:27,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 626 transitions. [2019-12-07 11:25:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 11:25:27,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:27,787 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, 1, 1, 1, 1] [2019-12-07 11:25:27,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:25:27,989 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:27,990 INFO L82 PathProgramCache]: Analyzing trace with hash -777117834, now seen corresponding path program 1 times [2019-12-07 11:25:27,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:27,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071526925] [2019-12-07 11:25:27,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:28,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:25:28,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:25:28,271 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:25:28,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071526925] [2019-12-07 11:25:28,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:28,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:25:28,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763680718] [2019-12-07 11:25:28,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:28,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:28,302 INFO L87 Difference]: Start difference. First operand 408 states and 626 transitions. Second operand 4 states. [2019-12-07 11:25:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:29,050 INFO L93 Difference]: Finished difference Result 937 states and 1464 transitions. [2019-12-07 11:25:29,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:29,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 11:25:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:29,054 INFO L225 Difference]: With dead ends: 937 [2019-12-07 11:25:29,054 INFO L226 Difference]: Without dead ends: 670 [2019-12-07 11:25:29,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-07 11:25:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-12-07 11:25:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-07 11:25:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1022 transitions. [2019-12-07 11:25:29,103 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1022 transitions. Word has length 106 [2019-12-07 11:25:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:29,104 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1022 transitions. [2019-12-07 11:25:29,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1022 transitions. [2019-12-07 11:25:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 11:25:29,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:29,109 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, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:29,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 11:25:29,310 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1045575103, now seen corresponding path program 1 times [2019-12-07 11:25:29,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:29,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058915528] [2019-12-07 11:25:29,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:29,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:25:29,517 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 11:25:29,550 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 11:25:29,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058915528] [2019-12-07 11:25:29,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:29,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:25:29,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362551335] [2019-12-07 11:25:29,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:29,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:29,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:29,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:29,588 INFO L87 Difference]: Start difference. First operand 670 states and 1022 transitions. Second operand 4 states. [2019-12-07 11:25:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:30,209 INFO L93 Difference]: Finished difference Result 1464 states and 2259 transitions. [2019-12-07 11:25:30,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:30,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-12-07 11:25:30,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:30,213 INFO L225 Difference]: With dead ends: 1464 [2019-12-07 11:25:30,213 INFO L226 Difference]: Without dead ends: 935 [2019-12-07 11:25:30,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-12-07 11:25:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2019-12-07 11:25:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-07 11:25:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1421 transitions. [2019-12-07 11:25:30,236 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1421 transitions. Word has length 171 [2019-12-07 11:25:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:30,237 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1421 transitions. [2019-12-07 11:25:30,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1421 transitions. [2019-12-07 11:25:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-12-07 11:25:30,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:30,240 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, 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-12-07 11:25:30,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 11:25:30,441 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:30,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:30,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1159127703, now seen corresponding path program 1 times [2019-12-07 11:25:30,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:30,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99382208] [2019-12-07 11:25:30,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:30,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:25:30,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 11:25:30,746 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 11:25:30,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99382208] [2019-12-07 11:25:30,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:30,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:25:30,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151809979] [2019-12-07 11:25:30,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:30,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:30,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:30,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:30,804 INFO L87 Difference]: Start difference. First operand 935 states and 1421 transitions. Second operand 4 states. [2019-12-07 11:25:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:31,647 INFO L93 Difference]: Finished difference Result 1992 states and 3052 transitions. [2019-12-07 11:25:31,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:31,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-12-07 11:25:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:31,654 INFO L225 Difference]: With dead ends: 1992 [2019-12-07 11:25:31,654 INFO L226 Difference]: Without dead ends: 1198 [2019-12-07 11:25:31,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-12-07 11:25:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2019-12-07 11:25:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-12-07 11:25:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1815 transitions. [2019-12-07 11:25:31,683 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1815 transitions. Word has length 236 [2019-12-07 11:25:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:31,684 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1815 transitions. [2019-12-07 11:25:31,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1815 transitions. [2019-12-07 11:25:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-12-07 11:25:31,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:31,687 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, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:31,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 11:25:31,888 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -822359279, now seen corresponding path program 1 times [2019-12-07 11:25:31,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:31,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597845278] [2019-12-07 11:25:31,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:32,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:25:32,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-12-07 11:25:32,193 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-12-07 11:25:32,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597845278] [2019-12-07 11:25:32,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:32,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:25:32,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692251409] [2019-12-07 11:25:32,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:32,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:32,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:32,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:32,251 INFO L87 Difference]: Start difference. First operand 1198 states and 1815 transitions. Second operand 4 states. [2019-12-07 11:25:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:32,996 INFO L93 Difference]: Finished difference Result 2518 states and 3838 transitions. [2019-12-07 11:25:32,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:32,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-12-07 11:25:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:33,004 INFO L225 Difference]: With dead ends: 2518 [2019-12-07 11:25:33,005 INFO L226 Difference]: Without dead ends: 1461 [2019-12-07 11:25:33,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-12-07 11:25:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2019-12-07 11:25:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2019-12-07 11:25:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2207 transitions. [2019-12-07 11:25:33,052 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2207 transitions. Word has length 309 [2019-12-07 11:25:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:33,052 INFO L462 AbstractCegarLoop]: Abstraction has 1461 states and 2207 transitions. [2019-12-07 11:25:33,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2207 transitions. [2019-12-07 11:25:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-12-07 11:25:33,058 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:33,059 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, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:33,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 11:25:33,260 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:33,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1870971484, now seen corresponding path program 1 times [2019-12-07 11:25:33,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:33,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212736636] [2019-12-07 11:25:33,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:33,589 INFO L264 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:25:33,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 726 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-12-07 11:25:33,681 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 726 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-12-07 11:25:33,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212736636] [2019-12-07 11:25:33,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:33,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:25:33,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377894890] [2019-12-07 11:25:33,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:33,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:33,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:33,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:33,761 INFO L87 Difference]: Start difference. First operand 1461 states and 2207 transitions. Second operand 4 states. [2019-12-07 11:25:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:34,342 INFO L93 Difference]: Finished difference Result 3042 states and 4617 transitions. [2019-12-07 11:25:34,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:34,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2019-12-07 11:25:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:34,349 INFO L225 Difference]: With dead ends: 3042 [2019-12-07 11:25:34,349 INFO L226 Difference]: Without dead ends: 1722 [2019-12-07 11:25:34,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-12-07 11:25:34,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2019-12-07 11:25:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-12-07 11:25:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2595 transitions. [2019-12-07 11:25:34,390 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2595 transitions. Word has length 382 [2019-12-07 11:25:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:34,390 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 2595 transitions. [2019-12-07 11:25:34,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2595 transitions. [2019-12-07 11:25:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-12-07 11:25:34,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:34,396 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:34,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 11:25:34,597 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1233938880, now seen corresponding path program 1 times [2019-12-07 11:25:34,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:34,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229426602] [2019-12-07 11:25:34,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:34,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:25:34,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:34,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:25:34,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:34,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:34,978 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:25:34,978 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:25:34,989 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 19 treesize of output 7 [2019-12-07 11:25:34,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:34,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:34,995 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:25:34,995 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:25:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 929 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-12-07 11:25:35,096 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 929 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-12-07 11:25:35,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229426602] [2019-12-07 11:25:35,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:35,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 11:25:35,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826232238] [2019-12-07 11:25:35,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:25:35,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:35,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:25:35,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:25:35,207 INFO L87 Difference]: Start difference. First operand 1722 states and 2595 transitions. Second operand 4 states. [2019-12-07 11:25:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:38,195 INFO L93 Difference]: Finished difference Result 3891 states and 5869 transitions. [2019-12-07 11:25:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:38,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 454 [2019-12-07 11:25:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:38,208 INFO L225 Difference]: With dead ends: 3891 [2019-12-07 11:25:38,208 INFO L226 Difference]: Without dead ends: 2177 [2019-12-07 11:25:38,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 904 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2019-12-07 11:25:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 1974. [2019-12-07 11:25:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2019-12-07 11:25:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3027 transitions. [2019-12-07 11:25:38,262 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3027 transitions. Word has length 454 [2019-12-07 11:25:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:38,263 INFO L462 AbstractCegarLoop]: Abstraction has 1974 states and 3027 transitions. [2019-12-07 11:25:38,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:25:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3027 transitions. [2019-12-07 11:25:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2019-12-07 11:25:38,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:38,267 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:38,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 11:25:38,468 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1735090506, now seen corresponding path program 1 times [2019-12-07 11:25:38,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:38,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571081188] [2019-12-07 11:25:38,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:38,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:25:38,846 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:38,868 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:25:38,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:25:38,869 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:38,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:38,878 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:25:38,878 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:25:38,896 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:25:38,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:25:38,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:38,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:38,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:25:38,898 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:25:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 1013 proven. 0 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2019-12-07 11:25:39,026 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1831 backedges. 1013 proven. 0 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2019-12-07 11:25:39,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571081188] [2019-12-07 11:25:39,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:39,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-12-07 11:25:39,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076241277] [2019-12-07 11:25:39,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:25:39,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:39,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:25:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:25:39,151 INFO L87 Difference]: Start difference. First operand 1974 states and 3027 transitions. Second operand 5 states. [2019-12-07 11:25:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:44,888 INFO L93 Difference]: Finished difference Result 4956 states and 7616 transitions. [2019-12-07 11:25:44,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:25:44,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 456 [2019-12-07 11:25:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:44,903 INFO L225 Difference]: With dead ends: 4956 [2019-12-07 11:25:44,904 INFO L226 Difference]: Without dead ends: 2990 [2019-12-07 11:25:44,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 907 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:25:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2019-12-07 11:25:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2394. [2019-12-07 11:25:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2019-12-07 11:25:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3795 transitions. [2019-12-07 11:25:44,960 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3795 transitions. Word has length 456 [2019-12-07 11:25:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:44,960 INFO L462 AbstractCegarLoop]: Abstraction has 2394 states and 3795 transitions. [2019-12-07 11:25:44,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:25:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3795 transitions. [2019-12-07 11:25:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-12-07 11:25:44,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:44,965 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:45,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 11:25:45,166 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1842956438, now seen corresponding path program 1 times [2019-12-07 11:25:45,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:45,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061388990] [2019-12-07 11:25:45,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:45,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:25:45,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:45,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:25:45,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:45,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:45,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:25:45,519 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:25:45,526 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 19 treesize of output 7 [2019-12-07 11:25:45,527 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:45,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:45,528 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:25:45,528 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:25:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 973 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:25:45,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 973 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:25:45,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061388990] [2019-12-07 11:25:45,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:45,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:25:45,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287047778] [2019-12-07 11:25:45,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:25:45,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:45,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:25:45,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:25:45,766 INFO L87 Difference]: Start difference. First operand 2394 states and 3795 transitions. Second operand 6 states. [2019-12-07 11:25:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:25:53,779 INFO L93 Difference]: Finished difference Result 6579 states and 10271 transitions. [2019-12-07 11:25:53,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:25:53,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 467 [2019-12-07 11:25:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:25:53,795 INFO L225 Difference]: With dead ends: 6579 [2019-12-07 11:25:53,795 INFO L226 Difference]: Without dead ends: 4193 [2019-12-07 11:25:53,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 934 GetRequests, 928 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:25:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2019-12-07 11:25:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 2602. [2019-12-07 11:25:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2019-12-07 11:25:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 4109 transitions. [2019-12-07 11:25:53,857 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 4109 transitions. Word has length 467 [2019-12-07 11:25:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:25:53,857 INFO L462 AbstractCegarLoop]: Abstraction has 2602 states and 4109 transitions. [2019-12-07 11:25:53,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:25:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 4109 transitions. [2019-12-07 11:25:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-12-07 11:25:53,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:25:53,861 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, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:25:54,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 11:25:54,062 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:25:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:25:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1252736466, now seen corresponding path program 1 times [2019-12-07 11:25:54,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:25:54,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015251915] [2019-12-07 11:25:54,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 11:25:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:25:54,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:25:54,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:25:54,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:25:54,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:54,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:54,450 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:25:54,451 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:25:54,459 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 19 treesize of output 7 [2019-12-07 11:25:54,459 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:25:54,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:25:54,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:25:54,461 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:25:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:25:54,564 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:25:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:25:54,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015251915] [2019-12-07 11:25:54,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:25:54,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:25:54,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101561428] [2019-12-07 11:25:54,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:25:54,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:25:54,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:25:54,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:25:54,670 INFO L87 Difference]: Start difference. First operand 2602 states and 4109 transitions. Second operand 6 states. [2019-12-07 11:26:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:02,590 INFO L93 Difference]: Finished difference Result 6970 states and 10874 transitions. [2019-12-07 11:26:02,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:02,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 468 [2019-12-07 11:26:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:02,607 INFO L225 Difference]: With dead ends: 6970 [2019-12-07 11:26:02,607 INFO L226 Difference]: Without dead ends: 4376 [2019-12-07 11:26:02,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 930 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:26:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2019-12-07 11:26:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 2745. [2019-12-07 11:26:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2745 states. [2019-12-07 11:26:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 4280 transitions. [2019-12-07 11:26:02,675 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 4280 transitions. Word has length 468 [2019-12-07 11:26:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:02,675 INFO L462 AbstractCegarLoop]: Abstraction has 2745 states and 4280 transitions. [2019-12-07 11:26:02,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:26:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 4280 transitions. [2019-12-07 11:26:02,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-12-07 11:26:02,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:02,679 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:02,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 11:26:02,880 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:02,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:02,880 INFO L82 PathProgramCache]: Analyzing trace with hash -322944423, now seen corresponding path program 1 times [2019-12-07 11:26:02,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:02,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7305344] [2019-12-07 11:26:02,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:03,239 INFO L264 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:26:03,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:26:03,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:26:03,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:03,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:03,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:03,252 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:26:03,259 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 19 treesize of output 7 [2019-12-07 11:26:03,259 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:03,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:03,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:03,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:26:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:03,375 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:26:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:03,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7305344] [2019-12-07 11:26:03,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:03,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:26:03,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688582142] [2019-12-07 11:26:03,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:26:03,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:26:03,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:26:03,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:26:03,484 INFO L87 Difference]: Start difference. First operand 2745 states and 4280 transitions. Second operand 6 states. [2019-12-07 11:26:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:12,525 INFO L93 Difference]: Finished difference Result 7089 states and 10971 transitions. [2019-12-07 11:26:12,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:12,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 468 [2019-12-07 11:26:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:12,541 INFO L225 Difference]: With dead ends: 7089 [2019-12-07 11:26:12,541 INFO L226 Difference]: Without dead ends: 4352 [2019-12-07 11:26:12,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 930 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:26:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4352 states. [2019-12-07 11:26:12,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4352 to 2823. [2019-12-07 11:26:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-07 11:26:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 4399 transitions. [2019-12-07 11:26:12,622 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 4399 transitions. Word has length 468 [2019-12-07 11:26:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:12,622 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 4399 transitions. [2019-12-07 11:26:12,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:26:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 4399 transitions. [2019-12-07 11:26:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-12-07 11:26:12,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:12,626 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, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:12,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 11:26:12,827 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:12,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1094780519, now seen corresponding path program 1 times [2019-12-07 11:26:12,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:12,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435829643] [2019-12-07 11:26:12,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:13,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:26:13,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:26:13,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:26:13,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:13,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:13,228 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:13,228 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:26:13,236 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 19 treesize of output 7 [2019-12-07 11:26:13,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:13,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:13,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:13,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:26:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1997 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:13,333 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:26:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1997 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:13,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435829643] [2019-12-07 11:26:13,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:13,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:26:13,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157402632] [2019-12-07 11:26:13,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:26:13,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:26:13,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:26:13,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:26:13,442 INFO L87 Difference]: Start difference. First operand 2823 states and 4399 transitions. Second operand 6 states. [2019-12-07 11:26:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:19,245 INFO L93 Difference]: Finished difference Result 7142 states and 11028 transitions. [2019-12-07 11:26:19,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:19,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 468 [2019-12-07 11:26:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:19,252 INFO L225 Difference]: With dead ends: 7142 [2019-12-07 11:26:19,252 INFO L226 Difference]: Without dead ends: 4327 [2019-12-07 11:26:19,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 930 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:26:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2019-12-07 11:26:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 2836. [2019-12-07 11:26:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2019-12-07 11:26:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 4388 transitions. [2019-12-07 11:26:19,320 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 4388 transitions. Word has length 468 [2019-12-07 11:26:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:19,321 INFO L462 AbstractCegarLoop]: Abstraction has 2836 states and 4388 transitions. [2019-12-07 11:26:19,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:26:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 4388 transitions. [2019-12-07 11:26:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-12-07 11:26:19,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:19,325 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, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:19,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 11:26:19,526 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash -619569470, now seen corresponding path program 1 times [2019-12-07 11:26:19,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:19,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174412248] [2019-12-07 11:26:19,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:19,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:26:19,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:26:19,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:26:19,923 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:19,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:19,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:19,927 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:26:19,935 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 19 treesize of output 7 [2019-12-07 11:26:19,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:19,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:19,937 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:19,937 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:26:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:20,028 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:26:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:20,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174412248] [2019-12-07 11:26:20,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:20,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:26:20,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460016327] [2019-12-07 11:26:20,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:26:20,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:26:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:26:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:26:20,145 INFO L87 Difference]: Start difference. First operand 2836 states and 4388 transitions. Second operand 6 states. [2019-12-07 11:26:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:26,444 INFO L93 Difference]: Finished difference Result 7155 states and 10980 transitions. [2019-12-07 11:26:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:26,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 468 [2019-12-07 11:26:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:26,451 INFO L225 Difference]: With dead ends: 7155 [2019-12-07 11:26:26,451 INFO L226 Difference]: Without dead ends: 4327 [2019-12-07 11:26:26,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 930 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:26:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2019-12-07 11:26:26,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 2836. [2019-12-07 11:26:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2019-12-07 11:26:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 4338 transitions. [2019-12-07 11:26:26,531 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 4338 transitions. Word has length 468 [2019-12-07 11:26:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:26,531 INFO L462 AbstractCegarLoop]: Abstraction has 2836 states and 4338 transitions. [2019-12-07 11:26:26,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:26:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 4338 transitions. [2019-12-07 11:26:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-12-07 11:26:26,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:26,535 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:26,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 11:26:26,737 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1309464461, now seen corresponding path program 1 times [2019-12-07 11:26:26,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:26,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410206569] [2019-12-07 11:26:26,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:27,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:26:27,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:26:27,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:26:27,122 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:27,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:27,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:27,125 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:26:27,132 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 19 treesize of output 7 [2019-12-07 11:26:27,133 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:27,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:27,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:27,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:26:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1932 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:27,236 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:26:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1932 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:27,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410206569] [2019-12-07 11:26:27,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:27,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:26:27,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115482557] [2019-12-07 11:26:27,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:26:27,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:26:27,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:26:27,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:26:27,343 INFO L87 Difference]: Start difference. First operand 2836 states and 4338 transitions. Second operand 6 states. [2019-12-07 11:26:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:36,580 INFO L93 Difference]: Finished difference Result 7155 states and 10880 transitions. [2019-12-07 11:26:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:36,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 469 [2019-12-07 11:26:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:36,586 INFO L225 Difference]: With dead ends: 7155 [2019-12-07 11:26:36,586 INFO L226 Difference]: Without dead ends: 4327 [2019-12-07 11:26:36,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:26:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2019-12-07 11:26:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 2836. [2019-12-07 11:26:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2019-12-07 11:26:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 4288 transitions. [2019-12-07 11:26:36,657 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 4288 transitions. Word has length 469 [2019-12-07 11:26:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:36,657 INFO L462 AbstractCegarLoop]: Abstraction has 2836 states and 4288 transitions. [2019-12-07 11:26:36,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:26:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 4288 transitions. [2019-12-07 11:26:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-12-07 11:26:36,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:36,661 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:36,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 11:26:36,863 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1453552679, now seen corresponding path program 1 times [2019-12-07 11:26:36,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:36,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525598572] [2019-12-07 11:26:36,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:37,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:26:37,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:26:37,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:26:37,250 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:37,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:37,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:37,254 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:26:37,262 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 19 treesize of output 7 [2019-12-07 11:26:37,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:37,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:37,263 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:37,264 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:26:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 947 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:37,369 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:26:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 947 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:37,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525598572] [2019-12-07 11:26:37,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:37,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:26:37,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276145473] [2019-12-07 11:26:37,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:26:37,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:26:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:26:37,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:26:37,477 INFO L87 Difference]: Start difference. First operand 2836 states and 4288 transitions. Second operand 6 states. [2019-12-07 11:26:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:44,653 INFO L93 Difference]: Finished difference Result 7155 states and 10780 transitions. [2019-12-07 11:26:44,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:44,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 470 [2019-12-07 11:26:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:44,658 INFO L225 Difference]: With dead ends: 7155 [2019-12-07 11:26:44,658 INFO L226 Difference]: Without dead ends: 4327 [2019-12-07 11:26:44,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 934 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:26:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2019-12-07 11:26:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 2836. [2019-12-07 11:26:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2019-12-07 11:26:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 4238 transitions. [2019-12-07 11:26:44,729 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 4238 transitions. Word has length 470 [2019-12-07 11:26:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:44,730 INFO L462 AbstractCegarLoop]: Abstraction has 2836 states and 4238 transitions. [2019-12-07 11:26:44,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:26:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 4238 transitions. [2019-12-07 11:26:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-12-07 11:26:44,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:44,734 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:44,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 11:26:44,934 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash -412303816, now seen corresponding path program 1 times [2019-12-07 11:26:44,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:44,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245381953] [2019-12-07 11:26:44,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:45,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:26:45,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:26:45,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:26:45,324 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:45,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:45,326 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:45,326 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:26:45,333 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 19 treesize of output 7 [2019-12-07 11:26:45,334 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:45,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:45,335 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:45,335 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:26:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:45,429 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:26:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:45,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245381953] [2019-12-07 11:26:45,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:45,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:26:45,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660418794] [2019-12-07 11:26:45,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:26:45,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:26:45,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:26:45,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:26:45,548 INFO L87 Difference]: Start difference. First operand 2836 states and 4238 transitions. Second operand 6 states. [2019-12-07 11:26:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:50,778 INFO L93 Difference]: Finished difference Result 6905 states and 10355 transitions. [2019-12-07 11:26:50,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:50,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 471 [2019-12-07 11:26:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:50,781 INFO L225 Difference]: With dead ends: 6905 [2019-12-07 11:26:50,782 INFO L226 Difference]: Without dead ends: 4077 [2019-12-07 11:26:50,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 936 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:26:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2019-12-07 11:26:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 2836. [2019-12-07 11:26:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2019-12-07 11:26:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 4188 transitions. [2019-12-07 11:26:50,855 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 4188 transitions. Word has length 471 [2019-12-07 11:26:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:50,855 INFO L462 AbstractCegarLoop]: Abstraction has 2836 states and 4188 transitions. [2019-12-07 11:26:50,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:26:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 4188 transitions. [2019-12-07 11:26:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-12-07 11:26:50,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:50,859 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:51,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 11:26:51,060 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash -571252318, now seen corresponding path program 1 times [2019-12-07 11:26:51,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:51,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895101450] [2019-12-07 11:26:51,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 11:26:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:26:51,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:26:51,424 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:26:51,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:26:51,430 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:51,433 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:51,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:51,433 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:26:51,441 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 19 treesize of output 7 [2019-12-07 11:26:51,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:26:51,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:26:51,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:26:51,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:26:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2013 backedges. 1015 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:51,552 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:26:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2013 backedges. 1015 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:26:51,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895101450] [2019-12-07 11:26:51,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:26:51,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:26:51,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565660791] [2019-12-07 11:26:51,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:26:51,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:26:51,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:26:51,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:26:51,665 INFO L87 Difference]: Start difference. First operand 2836 states and 4188 transitions. Second operand 6 states. [2019-12-07 11:26:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:26:59,597 INFO L93 Difference]: Finished difference Result 6918 states and 10234 transitions. [2019-12-07 11:26:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:26:59,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 471 [2019-12-07 11:26:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:26:59,601 INFO L225 Difference]: With dead ends: 6918 [2019-12-07 11:26:59,601 INFO L226 Difference]: Without dead ends: 4311 [2019-12-07 11:26:59,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 936 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:26:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2019-12-07 11:26:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 3083. [2019-12-07 11:26:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3083 states. [2019-12-07 11:26:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 4476 transitions. [2019-12-07 11:26:59,692 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 4476 transitions. Word has length 471 [2019-12-07 11:26:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:26:59,692 INFO L462 AbstractCegarLoop]: Abstraction has 3083 states and 4476 transitions. [2019-12-07 11:26:59,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:26:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 4476 transitions. [2019-12-07 11:26:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-12-07 11:26:59,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:26:59,696 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:26:59,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 11:26:59,897 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:26:59,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:26:59,897 INFO L82 PathProgramCache]: Analyzing trace with hash 662323766, now seen corresponding path program 1 times [2019-12-07 11:26:59,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:26:59,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716192671] [2019-12-07 11:26:59,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 11:27:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:00,279 INFO L264 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:27:00,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:27:00,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:27:00,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:00,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:00,290 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:00,291 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:27:00,301 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 19 treesize of output 7 [2019-12-07 11:27:00,301 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:00,302 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:00,303 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:00,303 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:27:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:27:00,404 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:27:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-12-07 11:27:00,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716192671] [2019-12-07 11:27:00,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:00,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:27:00,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808454143] [2019-12-07 11:27:00,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:27:00,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:27:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:27:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:27:00,523 INFO L87 Difference]: Start difference. First operand 3083 states and 4476 transitions. Second operand 6 states. [2019-12-07 11:27:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:08,604 INFO L93 Difference]: Finished difference Result 7157 states and 10475 transitions. [2019-12-07 11:27:08,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:27:08,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 472 [2019-12-07 11:27:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:08,607 INFO L225 Difference]: With dead ends: 7157 [2019-12-07 11:27:08,607 INFO L226 Difference]: Without dead ends: 4322 [2019-12-07 11:27:08,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 944 GetRequests, 938 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:27:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2019-12-07 11:27:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 3107. [2019-12-07 11:27:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3107 states. [2019-12-07 11:27:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 4477 transitions. [2019-12-07 11:27:08,689 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 4477 transitions. Word has length 472 [2019-12-07 11:27:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:08,689 INFO L462 AbstractCegarLoop]: Abstraction has 3107 states and 4477 transitions. [2019-12-07 11:27:08,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:27:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 4477 transitions. [2019-12-07 11:27:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-12-07 11:27:08,693 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:08,693 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:08,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 11:27:08,894 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:08,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1160512025, now seen corresponding path program 1 times [2019-12-07 11:27:08,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:27:08,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410369178] [2019-12-07 11:27:08,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 11:27:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:09,308 INFO L264 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:27:09,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:27:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1233 proven. 0 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2019-12-07 11:27:09,439 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:27:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1233 proven. 0 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2019-12-07 11:27:09,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410369178] [2019-12-07 11:27:09,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:09,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:27:09,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145192039] [2019-12-07 11:27:09,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:27:09,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:27:09,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:27:09,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:27:09,556 INFO L87 Difference]: Start difference. First operand 3107 states and 4477 transitions. Second operand 4 states. [2019-12-07 11:27:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:09,873 INFO L93 Difference]: Finished difference Result 6399 states and 9241 transitions. [2019-12-07 11:27:09,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:27:09,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 473 [2019-12-07 11:27:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:09,875 INFO L225 Difference]: With dead ends: 6399 [2019-12-07 11:27:09,875 INFO L226 Difference]: Without dead ends: 3554 [2019-12-07 11:27:09,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 944 GetRequests, 942 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:27:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-12-07 11:27:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3554. [2019-12-07 11:27:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3554 states. [2019-12-07 11:27:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 5110 transitions. [2019-12-07 11:27:09,969 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 5110 transitions. Word has length 473 [2019-12-07 11:27:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:09,969 INFO L462 AbstractCegarLoop]: Abstraction has 3554 states and 5110 transitions. [2019-12-07 11:27:09,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:27:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 5110 transitions. [2019-12-07 11:27:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2019-12-07 11:27:09,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:09,974 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:10,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 11:27:10,175 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:10,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:10,175 INFO L82 PathProgramCache]: Analyzing trace with hash -749209491, now seen corresponding path program 1 times [2019-12-07 11:27:10,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:27:10,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095340712] [2019-12-07 11:27:10,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 11:27:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:10,594 INFO L264 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:27:10,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:27:10,616 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:27:10,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:27:10,616 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:10,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:10,624 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:10,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:27:10,641 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:27:10,641 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:27:10,642 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:10,643 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:10,643 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:10,643 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:27:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2432 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:10,779 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:27:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2432 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:10,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095340712] [2019-12-07 11:27:10,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:10,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:27:10,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569650110] [2019-12-07 11:27:10,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:27:10,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:27:10,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:27:10,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:27:10,912 INFO L87 Difference]: Start difference. First operand 3554 states and 5110 transitions. Second operand 6 states. [2019-12-07 11:27:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:22,580 INFO L93 Difference]: Finished difference Result 8666 states and 12576 transitions. [2019-12-07 11:27:22,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:27:22,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 518 [2019-12-07 11:27:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:22,584 INFO L225 Difference]: With dead ends: 8666 [2019-12-07 11:27:22,585 INFO L226 Difference]: Without dead ends: 5372 [2019-12-07 11:27:22,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:27:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5372 states. [2019-12-07 11:27:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5372 to 3599. [2019-12-07 11:27:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-12-07 11:27:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 5172 transitions. [2019-12-07 11:27:22,686 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 5172 transitions. Word has length 518 [2019-12-07 11:27:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:22,686 INFO L462 AbstractCegarLoop]: Abstraction has 3599 states and 5172 transitions. [2019-12-07 11:27:22,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:27:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5172 transitions. [2019-12-07 11:27:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-12-07 11:27:22,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:22,691 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:27:22,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 11:27:22,892 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash -908485890, now seen corresponding path program 1 times [2019-12-07 11:27:22,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:27:22,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953158216] [2019-12-07 11:27:22,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 11:27:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:23,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:27:23,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:27:23,286 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:27:23,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:27:23,286 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:23,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:23,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:23,295 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:27:23,309 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:27:23,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:27:23,310 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:23,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:23,311 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:23,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:27:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2447 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:23,450 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:27:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2447 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:23,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953158216] [2019-12-07 11:27:23,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:23,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:27:23,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071427346] [2019-12-07 11:27:23,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:27:23,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:27:23,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:27:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:27:23,585 INFO L87 Difference]: Start difference. First operand 3599 states and 5172 transitions. Second operand 6 states. [2019-12-07 11:27:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:33,410 INFO L93 Difference]: Finished difference Result 9246 states and 13315 transitions. [2019-12-07 11:27:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:27:33,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 521 [2019-12-07 11:27:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:33,416 INFO L225 Difference]: With dead ends: 9246 [2019-12-07 11:27:33,416 INFO L226 Difference]: Without dead ends: 5666 [2019-12-07 11:27:33,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1042 GetRequests, 1036 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:27:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5666 states. [2019-12-07 11:27:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5666 to 3908. [2019-12-07 11:27:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3908 states. [2019-12-07 11:27:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5538 transitions. [2019-12-07 11:27:33,530 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5538 transitions. Word has length 521 [2019-12-07 11:27:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:33,530 INFO L462 AbstractCegarLoop]: Abstraction has 3908 states and 5538 transitions. [2019-12-07 11:27:33,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:27:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5538 transitions. [2019-12-07 11:27:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-12-07 11:27:33,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:33,535 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:33,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 11:27:33,737 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:33,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2057174098, now seen corresponding path program 1 times [2019-12-07 11:27:33,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:27:33,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075051491] [2019-12-07 11:27:33,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 11:27:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:34,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:27:34,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:27:34,168 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:27:34,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:27:34,169 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:34,177 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:34,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:34,177 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:27:34,192 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:27:34,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:27:34,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:34,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:34,194 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:34,194 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:27:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:34,338 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:27:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:34,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075051491] [2019-12-07 11:27:34,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:34,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:27:34,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53727730] [2019-12-07 11:27:34,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:27:34,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:27:34,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:27:34,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:27:34,486 INFO L87 Difference]: Start difference. First operand 3908 states and 5538 transitions. Second operand 6 states. [2019-12-07 11:27:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:43,777 INFO L93 Difference]: Finished difference Result 9891 states and 14073 transitions. [2019-12-07 11:27:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:27:43,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 521 [2019-12-07 11:27:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:43,783 INFO L225 Difference]: With dead ends: 9891 [2019-12-07 11:27:43,783 INFO L226 Difference]: Without dead ends: 6002 [2019-12-07 11:27:43,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1042 GetRequests, 1036 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:27:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-07 11:27:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 4274. [2019-12-07 11:27:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-12-07 11:27:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5990 transitions. [2019-12-07 11:27:43,917 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5990 transitions. Word has length 521 [2019-12-07 11:27:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:43,917 INFO L462 AbstractCegarLoop]: Abstraction has 4274 states and 5990 transitions. [2019-12-07 11:27:43,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:27:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5990 transitions. [2019-12-07 11:27:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-12-07 11:27:43,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:43,922 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:44,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 11:27:44,123 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:44,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:44,123 INFO L82 PathProgramCache]: Analyzing trace with hash -995615941, now seen corresponding path program 1 times [2019-12-07 11:27:44,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:27:44,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324829771] [2019-12-07 11:27:44,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 11:27:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:44,530 INFO L264 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:27:44,534 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:27:44,552 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:27:44,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:27:44,552 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:44,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:44,562 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:44,562 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:27:44,577 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:27:44,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:27:44,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:44,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:44,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:44,579 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:27:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 1201 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:44,713 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:27:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 1201 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:44,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324829771] [2019-12-07 11:27:44,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:44,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:27:44,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596946337] [2019-12-07 11:27:44,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:27:44,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:27:44,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:27:44,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:27:44,858 INFO L87 Difference]: Start difference. First operand 4274 states and 5990 transitions. Second operand 6 states. [2019-12-07 11:27:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:52,017 INFO L93 Difference]: Finished difference Result 10231 states and 14478 transitions. [2019-12-07 11:27:52,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:27:52,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 522 [2019-12-07 11:27:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:52,021 INFO L225 Difference]: With dead ends: 10231 [2019-12-07 11:27:52,021 INFO L226 Difference]: Without dead ends: 5976 [2019-12-07 11:27:52,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 1038 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:27:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2019-12-07 11:27:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 4288. [2019-12-07 11:27:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2019-12-07 11:27:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 5976 transitions. [2019-12-07 11:27:52,159 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 5976 transitions. Word has length 522 [2019-12-07 11:27:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:52,160 INFO L462 AbstractCegarLoop]: Abstraction has 4288 states and 5976 transitions. [2019-12-07 11:27:52,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:27:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 5976 transitions. [2019-12-07 11:27:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-12-07 11:27:52,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:52,165 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:52,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 11:27:52,366 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:27:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash 789192687, now seen corresponding path program 1 times [2019-12-07 11:27:52,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:27:52,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139988506] [2019-12-07 11:27:52,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 11:27:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:52,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:27:52,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:27:52,799 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:27:52,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:27:52,800 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:52,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:52,812 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:52,812 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:27:52,831 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:27:52,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:27:52,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:27:52,833 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:27:52,833 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:27:52,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:27:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 1222 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:52,974 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:27:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 1222 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:27:53,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139988506] [2019-12-07 11:27:53,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:53,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:27:53,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232319172] [2019-12-07 11:27:53,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:27:53,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:27:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:27:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:27:53,125 INFO L87 Difference]: Start difference. First operand 4288 states and 5976 transitions. Second operand 6 states. [2019-12-07 11:28:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:28:04,833 INFO L93 Difference]: Finished difference Result 10176 states and 14331 transitions. [2019-12-07 11:28:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:28:04,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 522 [2019-12-07 11:28:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:28:04,837 INFO L225 Difference]: With dead ends: 10176 [2019-12-07 11:28:04,837 INFO L226 Difference]: Without dead ends: 5907 [2019-12-07 11:28:04,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 1038 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:28:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5907 states. [2019-12-07 11:28:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5907 to 4317. [2019-12-07 11:28:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2019-12-07 11:28:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6006 transitions. [2019-12-07 11:28:04,972 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6006 transitions. Word has length 522 [2019-12-07 11:28:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:28:04,972 INFO L462 AbstractCegarLoop]: Abstraction has 4317 states and 6006 transitions. [2019-12-07 11:28:04,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:28:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6006 transitions. [2019-12-07 11:28:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-12-07 11:28:04,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:28:04,978 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:28:05,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 11:28:05,178 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:28:05,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:28:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash 395763791, now seen corresponding path program 1 times [2019-12-07 11:28:05,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:28:05,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886330432] [2019-12-07 11:28:05,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 11:28:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:28:05,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:28:05,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:28:05,564 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:28:05,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:28:05,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:05,574 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:05,574 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:05,574 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:28:05,592 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:28:05,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:28:05,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:05,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:05,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:05,594 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:28:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 1252 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:05,750 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:28:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 1252 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:05,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886330432] [2019-12-07 11:28:05,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:28:05,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:28:05,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999612038] [2019-12-07 11:28:05,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:28:05,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:28:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:28:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:28:05,891 INFO L87 Difference]: Start difference. First operand 4317 states and 6006 transitions. Second operand 6 states. [2019-12-07 11:28:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:28:14,430 INFO L93 Difference]: Finished difference Result 10580 states and 14783 transitions. [2019-12-07 11:28:14,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:28:14,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 524 [2019-12-07 11:28:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:28:14,434 INFO L225 Difference]: With dead ends: 10580 [2019-12-07 11:28:14,435 INFO L226 Difference]: Without dead ends: 6282 [2019-12-07 11:28:14,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1048 GetRequests, 1042 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:28:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2019-12-07 11:28:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 4737. [2019-12-07 11:28:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4737 states. [2019-12-07 11:28:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 6518 transitions. [2019-12-07 11:28:14,578 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 6518 transitions. Word has length 524 [2019-12-07 11:28:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:28:14,578 INFO L462 AbstractCegarLoop]: Abstraction has 4737 states and 6518 transitions. [2019-12-07 11:28:14,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:28:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 6518 transitions. [2019-12-07 11:28:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-12-07 11:28:14,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:28:14,582 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:28:14,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 11:28:14,783 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:28:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:28:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1138517328, now seen corresponding path program 1 times [2019-12-07 11:28:14,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:28:14,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740014004] [2019-12-07 11:28:14,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 11:28:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:28:15,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:28:15,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:28:15,211 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:28:15,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:28:15,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:15,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:15,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:15,220 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:28:15,234 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:28:15,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:28:15,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:15,236 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:15,236 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:15,236 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:28:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2519 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:15,392 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:28:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2519 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:15,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740014004] [2019-12-07 11:28:15,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:28:15,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:28:15,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665652418] [2019-12-07 11:28:15,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:28:15,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:28:15,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:28:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:28:15,544 INFO L87 Difference]: Start difference. First operand 4737 states and 6518 transitions. Second operand 6 states. [2019-12-07 11:28:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:28:24,040 INFO L93 Difference]: Finished difference Result 10941 states and 15188 transitions. [2019-12-07 11:28:24,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:28:24,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 525 [2019-12-07 11:28:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:28:24,044 INFO L225 Difference]: With dead ends: 10941 [2019-12-07 11:28:24,044 INFO L226 Difference]: Without dead ends: 6223 [2019-12-07 11:28:24,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1050 GetRequests, 1044 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:28:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6223 states. [2019-12-07 11:28:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6223 to 4797. [2019-12-07 11:28:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4797 states. [2019-12-07 11:28:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4797 states to 4797 states and 6610 transitions. [2019-12-07 11:28:24,193 INFO L78 Accepts]: Start accepts. Automaton has 4797 states and 6610 transitions. Word has length 525 [2019-12-07 11:28:24,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:28:24,193 INFO L462 AbstractCegarLoop]: Abstraction has 4797 states and 6610 transitions. [2019-12-07 11:28:24,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:28:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4797 states and 6610 transitions. [2019-12-07 11:28:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-12-07 11:28:24,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:28:24,197 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:28:24,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 11:28:24,398 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:28:24,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:28:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 438306991, now seen corresponding path program 1 times [2019-12-07 11:28:24,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:28:24,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200037750] [2019-12-07 11:28:24,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 11:28:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:28:24,828 INFO L264 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:28:24,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:28:24,848 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:28:24,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:28:24,849 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:24,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:24,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:24,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:28:24,875 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:28:24,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:28:24,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:24,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:24,878 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:24,878 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:28:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:25,023 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:28:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:25,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200037750] [2019-12-07 11:28:25,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:28:25,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:28:25,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442594290] [2019-12-07 11:28:25,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:28:25,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:28:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:28:25,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:28:25,178 INFO L87 Difference]: Start difference. First operand 4797 states and 6610 transitions. Second operand 6 states. [2019-12-07 11:28:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:28:33,953 INFO L93 Difference]: Finished difference Result 11436 states and 15792 transitions. [2019-12-07 11:28:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:28:33,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 526 [2019-12-07 11:28:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:28:33,958 INFO L225 Difference]: With dead ends: 11436 [2019-12-07 11:28:33,959 INFO L226 Difference]: Without dead ends: 6658 [2019-12-07 11:28:33,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1052 GetRequests, 1046 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:28:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6658 states. [2019-12-07 11:28:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6658 to 5247. [2019-12-07 11:28:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5247 states. [2019-12-07 11:28:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5247 states to 5247 states and 7152 transitions. [2019-12-07 11:28:34,144 INFO L78 Accepts]: Start accepts. Automaton has 5247 states and 7152 transitions. Word has length 526 [2019-12-07 11:28:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:28:34,144 INFO L462 AbstractCegarLoop]: Abstraction has 5247 states and 7152 transitions. [2019-12-07 11:28:34,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:28:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5247 states and 7152 transitions. [2019-12-07 11:28:34,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-12-07 11:28:34,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:28:34,148 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:28:34,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 11:28:34,349 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:28:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:28:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash 730102811, now seen corresponding path program 1 times [2019-12-07 11:28:34,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:28:34,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91840509] [2019-12-07 11:28:34,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 11:28:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:28:34,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:28:34,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:28:34,777 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:28:34,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:28:34,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:34,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:34,784 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:34,785 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:28:34,799 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:28:34,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:28:34,799 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:34,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:34,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:34,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:28:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2493 backedges. 1235 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:34,941 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:28:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2493 backedges. 1235 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:35,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91840509] [2019-12-07 11:28:35,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:28:35,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:28:35,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423002153] [2019-12-07 11:28:35,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:28:35,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:28:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:28:35,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:28:35,095 INFO L87 Difference]: Start difference. First operand 5247 states and 7152 transitions. Second operand 6 states. [2019-12-07 11:28:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:28:44,512 INFO L93 Difference]: Finished difference Result 12351 states and 16891 transitions. [2019-12-07 11:28:44,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:28:44,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 527 [2019-12-07 11:28:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:28:44,517 INFO L225 Difference]: With dead ends: 12351 [2019-12-07 11:28:44,517 INFO L226 Difference]: Without dead ends: 7123 [2019-12-07 11:28:44,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 1048 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:28:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7123 states. [2019-12-07 11:28:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7123 to 5637. [2019-12-07 11:28:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5637 states. [2019-12-07 11:28:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 7574 transitions. [2019-12-07 11:28:44,702 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 7574 transitions. Word has length 527 [2019-12-07 11:28:44,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:28:44,703 INFO L462 AbstractCegarLoop]: Abstraction has 5637 states and 7574 transitions. [2019-12-07 11:28:44,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:28:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 7574 transitions. [2019-12-07 11:28:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-12-07 11:28:44,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:28:44,707 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:28:44,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 11:28:44,908 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:28:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:28:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 529056272, now seen corresponding path program 1 times [2019-12-07 11:28:44,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:28:44,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43081597] [2019-12-07 11:28:44,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 11:28:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:28:45,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:28:45,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:28:45,353 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:28:45,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:28:45,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:45,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:45,364 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:45,364 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:28:45,379 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:28:45,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:28:45,380 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:45,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:45,381 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:45,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:28:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:45,528 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:28:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:45,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43081597] [2019-12-07 11:28:45,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:28:45,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:28:45,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218326936] [2019-12-07 11:28:45,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:28:45,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:28:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:28:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:28:45,688 INFO L87 Difference]: Start difference. First operand 5637 states and 7574 transitions. Second operand 6 states. [2019-12-07 11:28:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:28:54,628 INFO L93 Difference]: Finished difference Result 12655 states and 17154 transitions. [2019-12-07 11:28:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:28:54,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 527 [2019-12-07 11:28:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:28:54,636 INFO L225 Difference]: With dead ends: 12655 [2019-12-07 11:28:54,637 INFO L226 Difference]: Without dead ends: 7037 [2019-12-07 11:28:54,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 1048 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:28:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7037 states. [2019-12-07 11:28:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7037 to 5667. [2019-12-07 11:28:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5667 states. [2019-12-07 11:28:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5667 states to 5667 states and 7606 transitions. [2019-12-07 11:28:54,830 INFO L78 Accepts]: Start accepts. Automaton has 5667 states and 7606 transitions. Word has length 527 [2019-12-07 11:28:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:28:54,830 INFO L462 AbstractCegarLoop]: Abstraction has 5667 states and 7606 transitions. [2019-12-07 11:28:54,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:28:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5667 states and 7606 transitions. [2019-12-07 11:28:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-12-07 11:28:54,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:28:54,834 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:28:55,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 11:28:55,036 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:28:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:28:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1356005402, now seen corresponding path program 1 times [2019-12-07 11:28:55,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:28:55,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188375899] [2019-12-07 11:28:55,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 11:28:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:28:55,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:28:55,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:28:55,493 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:28:55,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:28:55,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:55,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:55,502 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:55,502 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:28:55,516 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:28:55,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:28:55,517 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:28:55,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:28:55,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:28:55,518 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:28:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1245 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:55,659 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:28:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1245 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:28:55,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188375899] [2019-12-07 11:28:55,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:28:55,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:28:55,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28627737] [2019-12-07 11:28:55,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:28:55,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:28:55,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:28:55,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:28:55,812 INFO L87 Difference]: Start difference. First operand 5667 states and 7606 transitions. Second operand 6 states. [2019-12-07 11:29:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:04,563 INFO L93 Difference]: Finished difference Result 12659 states and 17119 transitions. [2019-12-07 11:29:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:29:04,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 528 [2019-12-07 11:29:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:04,574 INFO L225 Difference]: With dead ends: 12659 [2019-12-07 11:29:04,575 INFO L226 Difference]: Without dead ends: 7011 [2019-12-07 11:29:04,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 1050 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:29:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7011 states. [2019-12-07 11:29:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7011 to 5667. [2019-12-07 11:29:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5667 states. [2019-12-07 11:29:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5667 states to 5667 states and 7548 transitions. [2019-12-07 11:29:04,769 INFO L78 Accepts]: Start accepts. Automaton has 5667 states and 7548 transitions. Word has length 528 [2019-12-07 11:29:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:04,769 INFO L462 AbstractCegarLoop]: Abstraction has 5667 states and 7548 transitions. [2019-12-07 11:29:04,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:29:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5667 states and 7548 transitions. [2019-12-07 11:29:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-12-07 11:29:04,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:04,773 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:04,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 11:29:04,974 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1569262865, now seen corresponding path program 1 times [2019-12-07 11:29:04,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:29:04,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178007413] [2019-12-07 11:29:04,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 11:29:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:05,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:29:05,374 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:29:05,391 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:29:05,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 11:29:05,392 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:05,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:05,400 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:05,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 11:29:05,416 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:29:05,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:29:05,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:05,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:05,418 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:05,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 11:29:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 1286 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:29:05,571 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:29:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 1286 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:29:05,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178007413] [2019-12-07 11:29:05,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:05,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:29:05,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269244040] [2019-12-07 11:29:05,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:29:05,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:29:05,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:29:05,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:29:05,727 INFO L87 Difference]: Start difference. First operand 5667 states and 7548 transitions. Second operand 6 states. [2019-12-07 11:29:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:12,540 INFO L93 Difference]: Finished difference Result 13040 states and 17431 transitions. [2019-12-07 11:29:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:29:12,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 528 [2019-12-07 11:29:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:12,548 INFO L225 Difference]: With dead ends: 13040 [2019-12-07 11:29:12,549 INFO L226 Difference]: Without dead ends: 7392 [2019-12-07 11:29:12,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 1050 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:29:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7392 states. [2019-12-07 11:29:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7392 to 6147. [2019-12-07 11:29:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6147 states. [2019-12-07 11:29:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 8090 transitions. [2019-12-07 11:29:12,755 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 8090 transitions. Word has length 528 [2019-12-07 11:29:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:12,755 INFO L462 AbstractCegarLoop]: Abstraction has 6147 states and 8090 transitions. [2019-12-07 11:29:12,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:29:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 8090 transitions. [2019-12-07 11:29:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-12-07 11:29:12,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:12,759 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:12,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 11:29:12,960 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash -12666112, now seen corresponding path program 1 times [2019-12-07 11:29:12,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:29:12,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233447728] [2019-12-07 11:29:12,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 11:29:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:13,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:29:13,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:29:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 1446 proven. 0 refuted. 0 times theorem prover too weak. 1123 trivial. 0 not checked. [2019-12-07 11:29:13,515 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:29:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 1446 proven. 0 refuted. 0 times theorem prover too weak. 1123 trivial. 0 not checked. [2019-12-07 11:29:13,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233447728] [2019-12-07 11:29:13,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:13,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:29:13,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976874362] [2019-12-07 11:29:13,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:13,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:29:13,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:13,660 INFO L87 Difference]: Start difference. First operand 6147 states and 8090 transitions. Second operand 4 states. [2019-12-07 11:29:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:14,649 INFO L93 Difference]: Finished difference Result 12712 states and 16748 transitions. [2019-12-07 11:29:14,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:14,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 532 [2019-12-07 11:29:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:14,653 INFO L225 Difference]: With dead ends: 12712 [2019-12-07 11:29:14,654 INFO L226 Difference]: Without dead ends: 6981 [2019-12-07 11:29:14,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 1060 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6981 states. [2019-12-07 11:29:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6981 to 6981. [2019-12-07 11:29:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6981 states. [2019-12-07 11:29:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6981 states to 6981 states and 9177 transitions. [2019-12-07 11:29:14,890 INFO L78 Accepts]: Start accepts. Automaton has 6981 states and 9177 transitions. Word has length 532 [2019-12-07 11:29:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:14,890 INFO L462 AbstractCegarLoop]: Abstraction has 6981 states and 9177 transitions. [2019-12-07 11:29:14,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6981 states and 9177 transitions. [2019-12-07 11:29:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-12-07 11:29:14,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:14,895 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:15,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 11:29:15,096 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1984148086, now seen corresponding path program 1 times [2019-12-07 11:29:15,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:29:15,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144393486] [2019-12-07 11:29:15,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 11:29:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:15,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:29:15,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:29:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 1460 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-12-07 11:29:15,648 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:29:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 1460 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-12-07 11:29:15,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144393486] [2019-12-07 11:29:15,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:15,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:29:15,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386806628] [2019-12-07 11:29:15,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:29:15,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:29:15,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:29:15,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:29:15,788 INFO L87 Difference]: Start difference. First operand 6981 states and 9177 transitions. Second operand 3 states. [2019-12-07 11:29:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:17,112 INFO L93 Difference]: Finished difference Result 13965 states and 18370 transitions. [2019-12-07 11:29:17,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:29:17,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 573 [2019-12-07 11:29:17,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:17,116 INFO L225 Difference]: With dead ends: 13965 [2019-12-07 11:29:17,116 INFO L226 Difference]: Without dead ends: 7400 [2019-12-07 11:29:17,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 1143 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:29:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7400 states. [2019-12-07 11:29:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7400 to 7400. [2019-12-07 11:29:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7400 states. [2019-12-07 11:29:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7400 states to 7400 states and 9721 transitions. [2019-12-07 11:29:17,349 INFO L78 Accepts]: Start accepts. Automaton has 7400 states and 9721 transitions. Word has length 573 [2019-12-07 11:29:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:17,349 INFO L462 AbstractCegarLoop]: Abstraction has 7400 states and 9721 transitions. [2019-12-07 11:29:17,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:29:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7400 states and 9721 transitions. [2019-12-07 11:29:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-12-07 11:29:17,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:17,356 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:17,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 11:29:17,556 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash 663416870, now seen corresponding path program 1 times [2019-12-07 11:29:17,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:29:17,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835875077] [2019-12-07 11:29:17,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 11:29:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:18,025 INFO L264 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:29:18,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:29:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3447 backedges. 1917 proven. 0 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2019-12-07 11:29:18,206 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:29:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3447 backedges. 1917 proven. 0 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2019-12-07 11:29:18,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835875077] [2019-12-07 11:29:18,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:18,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:29:18,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451905617] [2019-12-07 11:29:18,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:18,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:29:18,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:18,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:18,381 INFO L87 Difference]: Start difference. First operand 7400 states and 9721 transitions. Second operand 4 states. [2019-12-07 11:29:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:20,729 INFO L93 Difference]: Finished difference Result 15214 states and 20004 transitions. [2019-12-07 11:29:20,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:20,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 608 [2019-12-07 11:29:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:20,736 INFO L225 Difference]: With dead ends: 15214 [2019-12-07 11:29:20,736 INFO L226 Difference]: Without dead ends: 8230 [2019-12-07 11:29:20,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 1212 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8230 states. [2019-12-07 11:29:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8230 to 8230. [2019-12-07 11:29:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8230 states. [2019-12-07 11:29:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8230 states to 8230 states and 10802 transitions. [2019-12-07 11:29:21,028 INFO L78 Accepts]: Start accepts. Automaton has 8230 states and 10802 transitions. Word has length 608 [2019-12-07 11:29:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:21,028 INFO L462 AbstractCegarLoop]: Abstraction has 8230 states and 10802 transitions. [2019-12-07 11:29:21,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 8230 states and 10802 transitions. [2019-12-07 11:29:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-12-07 11:29:21,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:21,034 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:21,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 11:29:21,235 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:21,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1382814393, now seen corresponding path program 1 times [2019-12-07 11:29:21,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:29:21,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317438342] [2019-12-07 11:29:21,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 11:29:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:22,446 INFO L264 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:29:22,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:29:22,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 11:29:22,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:22,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:22,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:22,461 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:29:22,483 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:29:22,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 11:29:22,483 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:22,492 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:22,492 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:22,492 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 11:29:22,512 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 11:29:22,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 11:29:22,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:22,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:22,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:22,514 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-12-07 11:29:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 2229 proven. 0 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-12-07 11:29:22,757 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:29:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 2229 proven. 0 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-12-07 11:29:22,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317438342] [2019-12-07 11:29:22,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:22,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 11:29:22,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710269475] [2019-12-07 11:29:22,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:29:22,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:29:22,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:29:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:29:22,979 INFO L87 Difference]: Start difference. First operand 8230 states and 10802 transitions. Second operand 7 states. [2019-12-07 11:29:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:34,667 INFO L93 Difference]: Finished difference Result 21143 states and 27815 transitions. [2019-12-07 11:29:34,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:29:34,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 647 [2019-12-07 11:29:34,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:34,678 INFO L225 Difference]: With dead ends: 21143 [2019-12-07 11:29:34,678 INFO L226 Difference]: Without dead ends: 12932 [2019-12-07 11:29:34,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1286 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:29:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12932 states. [2019-12-07 11:29:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12932 to 9086. [2019-12-07 11:29:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-12-07 11:29:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 11938 transitions. [2019-12-07 11:29:35,010 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 11938 transitions. Word has length 647 [2019-12-07 11:29:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:35,010 INFO L462 AbstractCegarLoop]: Abstraction has 9086 states and 11938 transitions. [2019-12-07 11:29:35,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:29:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 11938 transitions. [2019-12-07 11:29:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-12-07 11:29:35,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:35,017 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:35,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 11:29:35,217 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:35,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:35,218 INFO L82 PathProgramCache]: Analyzing trace with hash -899423237, now seen corresponding path program 1 times [2019-12-07 11:29:35,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:29:35,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710009121] [2019-12-07 11:29:35,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 11:29:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:36,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 11:29:36,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:29:36,651 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-12-07 11:29:36,651 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:36,850 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 11:29:36,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:36,851 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_749|], 2=[|v_#memory_$Pointer$.base_744|, |v_#memory_$Pointer$.base_743|]} [2019-12-07 11:29:36,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:36,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:36,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:36,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:36,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:36,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:36,910 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-12-07 11:29:36,910 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,017 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 11:29:37,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,037 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-12-07 11:29:37,038 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,072 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,080 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-12-07 11:29:37,081 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,095 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,096 INFO L534 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-12-07 11:29:37,096 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 11:29:37,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,107 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-12-07 11:29:37,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,113 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 11:29:37,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,118 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-12-07 11:29:37,118 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,123 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 11:29:37,128 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,153 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-12-07 11:29:37,153 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,161 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,161 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 11:29:37,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,165 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-12-07 11:29:37,165 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,170 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 11:29:37,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,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, 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-12-07 11:29:37,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,178 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 11:29:37,182 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,205 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-12-07 11:29:37,205 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,212 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,212 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 11:29:37,215 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_744|], 2=[|v_#memory_$Pointer$.base_756|]} [2019-12-07 11:29:37,217 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-12-07 11:29:37,217 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,229 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 11:29:37,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:37,261 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,274 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 11:29:37,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,274 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 11:29:37,278 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,299 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-12-07 11:29:37,299 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,307 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,307 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 11:29:37,310 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_745|], 2=[|v_#memory_$Pointer$.base_758|]} [2019-12-07 11:29:37,312 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-12-07 11:29:37,313 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,325 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,357 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 11:29:37,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:29:37,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:37,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:37,358 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 11:29:37,374 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 11:29:37,374 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,375 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 11:29:37,377 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_789|, |v_#memory_$Pointer$.offset_743|], 2=[|v_#memory_$Pointer$.base_748|, |v_#memory_$Pointer$.base_759|]} [2019-12-07 11:29:37,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,384 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 109 treesize of output 40 [2019-12-07 11:29:37,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,416 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 21 treesize of output 15 [2019-12-07 11:29:37,416 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,443 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,461 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 31 treesize of output 27 [2019-12-07 11:29:37,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:29:37,466 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 22 treesize of output 14 [2019-12-07 11:29:37,466 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,472 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,485 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:37,485 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:142, output treesize:35 [2019-12-07 11:29:37,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 11:29:37,530 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,534 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:37,535 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,535 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-12-07 11:29:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 1416 proven. 91 refuted. 0 times theorem prover too weak. 2439 trivial. 0 not checked. [2019-12-07 11:29:38,019 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:29:38,043 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_743|, |#memory_int|], 2=[|v_#memory_$Pointer$.base_748|]} [2019-12-07 11:29:38,047 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 62 treesize of output 56 [2019-12-07 11:29:38,048 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:29:38,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:46,174 WARN L192 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 11:29:46,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:46,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 88 [2019-12-07 11:29:46,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:29:46,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:46,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:46,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:46,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 88 [2019-12-07 11:29:46,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:46,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:29:46,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:46,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:46,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:29:46,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:46,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:46,197 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:29:46,198 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_66], 1=[v_arrayElimCell_67]} [2019-12-07 11:29:46,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710009121] [2019-12-07 11:29:46,201 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@58aef12b [2019-12-07 11:29:46,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2073347046] [2019-12-07 11:29:46,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:30:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:01,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 11:30:01,731 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@58aef12b [2019-12-07 11:30:01,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846564637] [2019-12-07 11:30:01,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22236261-f161-4d7c-8850-8b7fd0946764/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:02,088 INFO L264 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:30:02,094 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:02,095 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@58aef12b [2019-12-07 11:30:02,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:02,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 11:30:02,095 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 11:30:02,095 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:30:02,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:30:02,787 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 11:30:02,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:30:02 BoogieIcfgContainer [2019-12-07 11:30:02,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:30:02,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:30:02,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:30:02,788 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:30:02,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:25:27" (3/4) ... [2019-12-07 11:30:02,790 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:30:02,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:30:02,791 INFO L168 Benchmark]: Toolchain (without parser) took 278078.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 522.7 MB). Free memory was 948.4 MB in the beginning and 773.7 MB in the end (delta: 174.6 MB). Peak memory consumption was 697.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:02,791 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:30:02,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:02,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.27 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:02,792 INFO L168 Benchmark]: Boogie Preprocessor took 71.09 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: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:02,792 INFO L168 Benchmark]: RCFGBuilder took 1981.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.6 MB in the end (delta: 102.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:02,792 INFO L168 Benchmark]: TraceAbstraction took 275514.28 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 389.0 MB). Free memory was 983.6 MB in the beginning and 773.7 MB in the end (delta: 209.9 MB). Peak memory consumption was 598.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:02,792 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 1.6 GB. Free memory is still 773.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:30:02,793 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 435.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.27 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.09 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: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1981.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.6 MB in the end (delta: 102.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275514.28 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 389.0 MB). Free memory was 983.6 MB in the beginning and 773.7 MB in the end (delta: 209.9 MB). Peak memory consumption was 598.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.67 ms. Allocated memory is still 1.6 GB. Free memory is still 773.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1766]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 3 [L1370] COND FALSE !(ret <= 0) [L1376] s->state = 8528 [L1377] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 3 [L1407] blastFlag = 4 [L1411] COND FALSE !(ret <= 0) [L1428] s->state = 8544 [L1429] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 4 [L1457] blastFlag = 5 [L1461] COND FALSE !(ret <= 0) [L1466] s->state = 8448 [L1467] EXPR s->s3 [L1467] (s->s3)->tmp.next_state = 8576 [L1468] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND TRUE s->state == 8576 [L1507] ret = __VERIFIER_nondet_int() [L1508] COND TRUE blastFlag == 5 [L1509] blastFlag = 6 [L1513] COND FALSE !(ret <= 0) [L1518] COND FALSE !(ret == 2) [L1521] ret = __VERIFIER_nondet_int() [L1522] COND TRUE blastFlag == 6 [L1523] blastFlag = 7 [L1527] COND FALSE !(ret <= 0) [L1532] s->init_num = 0 [L1533] s->state = 8592 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND TRUE s->state == 8592 [L1538] ret = __VERIFIER_nondet_int() [L1539] COND TRUE blastFlag == 7 [L1540] blastFlag = 8 [L1544] COND FALSE !(ret <= 0) [L1549] s->state = 8608 [L1550] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND TRUE s->state == 8608 [L1554] ret = __VERIFIER_nondet_int() [L1555] COND TRUE blastFlag == 8 [L1556] blastFlag = 9 [L1560] COND FALSE !(ret <= 0) [L1565] s->state = 8640 [L1566] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND TRUE blastFlag == 9 [L1572] blastFlag = 10 [L1588] COND FALSE !(ret <= 0) [L1593] s->hit [L1593] COND FALSE !(s->hit) [L1596] s->state = 8656 [L1598] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1602] EXPR s->session [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.new_cipher [L1602] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1603] COND FALSE !(! tmp___9) [L1609] ret = __VERIFIER_nondet_int() [L1610] COND TRUE blastFlag == 10 [L1611] blastFlag = 11 [L1623] COND FALSE !(ret <= 0) [L1628] s->state = 8672 [L1629] s->init_num = 0 [L1630] COND FALSE !(! tmp___10) [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1639] ret = __VERIFIER_nondet_int() [L1640] COND TRUE blastFlag == 11 [L1641] blastFlag = 12 [L1653] COND FALSE !(ret <= 0) [L1658] s->state = 8448 [L1659] s->hit [L1659] COND TRUE s->hit [L1660] EXPR s->s3 [L1660] (s->s3)->tmp.next_state = 8640 [L1664] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND TRUE blastFlag == 12 [L1575] blastFlag = 13 [L1588] COND FALSE !(ret <= 0) [L1593] s->hit [L1593] COND FALSE !(s->hit) [L1596] s->state = 8656 [L1598] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1602] EXPR s->session [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.new_cipher [L1602] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1603] COND FALSE !(! tmp___9) [L1609] ret = __VERIFIER_nondet_int() [L1610] COND FALSE !(blastFlag == 10) [L1613] COND TRUE blastFlag == 13 [L1614] blastFlag = 14 [L1623] COND FALSE !(ret <= 0) [L1628] s->state = 8672 [L1629] s->init_num = 0 [L1630] COND FALSE !(! tmp___10) [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1639] ret = __VERIFIER_nondet_int() [L1640] COND FALSE !(blastFlag == 11) [L1643] COND TRUE blastFlag == 14 [L1644] blastFlag = 15 [L1653] COND FALSE !(ret <= 0) [L1658] s->state = 8448 [L1659] s->hit [L1659] COND TRUE s->hit [L1660] EXPR s->s3 [L1660] (s->s3)->tmp.next_state = 8640 [L1664] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND FALSE !(blastFlag == 12) [L1577] COND TRUE blastFlag == 15 [L1578] blastFlag = 16 [L1588] COND FALSE !(ret <= 0) [L1593] s->hit [L1593] COND FALSE !(s->hit) [L1596] s->state = 8656 [L1598] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1602] EXPR s->session [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.new_cipher [L1602] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1603] COND FALSE !(! tmp___9) [L1609] ret = __VERIFIER_nondet_int() [L1610] COND FALSE !(blastFlag == 10) [L1613] COND FALSE !(blastFlag == 13) [L1616] COND TRUE blastFlag == 16 [L1617] blastFlag = 17 [L1623] COND FALSE !(ret <= 0) [L1628] s->state = 8672 [L1629] s->init_num = 0 [L1630] COND FALSE !(! tmp___10) [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1639] ret = __VERIFIER_nondet_int() [L1640] COND FALSE !(blastFlag == 11) [L1643] COND FALSE !(blastFlag == 14) [L1646] COND TRUE blastFlag == 17 [L1647] blastFlag = 18 [L1653] COND FALSE !(ret <= 0) [L1658] s->state = 8448 [L1659] s->hit [L1659] COND TRUE s->hit [L1660] EXPR s->s3 [L1660] (s->s3)->tmp.next_state = 8640 [L1664] s->init_num = 0 [L1725] EXPR s->s3 [L1725] EXPR (s->s3)->tmp.reuse_message [L1725] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1754] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND FALSE !(blastFlag == 12) [L1577] COND FALSE !(blastFlag == 15) [L1580] COND TRUE blastFlag == 18 [L1766] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 157 locations, 1 error locations. Result: UNKNOWN, OverallTime: 275.3s, OverallIterations: 36, TraceHistogramMax: 18, AutomataDifference: 213.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8297 SDtfs, 7549 SDslu, 17064 SDs, 0 SdLazy, 13073 SolverSat, 1755 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 199.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31923 GetRequests, 31756 SyntacticMatches, 1 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9086occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 37408 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.1s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 15972 NumberOfCodeBlocks, 15972 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 31874 ConstructedInterpolants, 0 QuantifiedInterpolants, 22334507 SizeOfPredicates, 77 NumberOfNonLiveVariables, 33843 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 70 InterpolantComputations, 70 PerfectInterpolantSequences, 141908/141908 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...